Break-Resilient Codes for Forensic 3D Fingerprinting (2310.03897v2)
Abstract: 3D printing brings about a revolution in consumption and distribution of goods, but poses a significant risk to public safety. Any individual with internet access and a commodity printer can now produce untraceable firearms, keys, and dangerous counterfeit products. To aid government authorities in combating these new security threats, objects are often tagged with identifying information. This information, also known as fingerprints, is written into the object using various bit embedding techniques, such as varying the width of the molten thermoplastic layers. Yet, due to the adversarial nature of the problem, it is important to devise tamper resilient fingerprinting techniques, so that the fingerprint could be extracted even if the object was damaged. While fingerprinting various forms of digital media (such as videos, images, etc.) has been studied extensively in the past, 3D printing is a relatively new medium which is exposed to different types of adversarial physical tampering that do not exist in the digital world. This paper focuses on one such type of adversarial tampering, where the adversary breaks the object to at most a certain number of parts. This gives rise to a new adversarial coding problem, which is formulated and investigated herein. We survey the existing technology, present an abstract problem definition, provide lower bounds for the required redundancy, and construct a code which attains it up to asymptotically small factors. Notably, the problem bears some resemblance to the torn paper channel, which was recently studied for applications in DNA storage.
- Marrian Zhou “3D-printed gun controversy: Everything you need to know” accessed Sep. 15st, 2023, https://www.cnet.com/news/politics/the-3d-printed-gun-controversy-everything-you-need-to-know/ In CNET, 2018
- “Untraceable ‘ghost guns’ are easier than ever to 3D print — we went inside a company that helps people do it” accessed (Oct. 21st, 2021), https://news.yahoo.com/untraceable-ghost-guns-easier-ever-150015562.html In Insider Magazine, 2021
- Connor M McNulty, Neyla Arnas and Thomas A Campbell “Toward the printed world: Additive manufacturing and implications for national security” In Defense Horizons National Defense University Press, 2012, pp. 1
- Jon Fingas “Security firm claims to thwart iPhone X’s Face ID with a mask” accessed Sep. 15st, 2023, https://www.engadget.com//2017-11-11-security-firm-claims-to-defeat-face-id-with-mask.html In ENGADGET, 2019
- Alexander Barg, G Robert Blakley and Gregory A Kabatiansky “Digital fingerprinting codes: Problem statements, constructions, identification of traitors” In IEEE Transactions on Information Theory 49.4 IEEE, 2003, pp. 852–865
- “Collusion-secure fingerprinting for digital data” In IEEE Transactions on Information Theory 44.5 IEEE, 1998, pp. 1897–1905
- “Blind watermarking for 3-D printed objects by locally modifying layer thickness” In IEEE Transactions on Multimedia 22.11 IEEE, 2019, pp. 2780–2791
- “Embedding information into objects fabricated with 3-D printers by forming fine cavities inside them” In Electronic Imaging 2017.7 Society for Imaging ScienceTechnology, 2017, pp. 6–9
- Karim A ElSayed, Adam Dachowicz and Jitesh H Panchal “Information embedding in additive manufacturing through printing speed control” In Proceedings of the 2021 Workshop on Additive Manufacturing (3D Printing) Security, 2021, pp. 31–37
- “PrinTracker: Fingerprinting 3D printers using commodity scanners” In Proceedings of the 2018 ACM sigsac conference on computer and communications security, 2018, pp. 1306–1323
- “Three dimensional (3d) printed objects with embedded identification (id) elements” US Patent 9,656,428 Google Patents, 2017
- “Product authentication” U.S. Patent App. 14/250,533, 2015
- “Objets de vertu” U.S. Patent App. 14/485,880, 2015
- “Embedding anti-counterfeiting features in metallic components via multiple material additive manufacturing” In Additive Manufacturing 24 Elsevier, 2018, pp. 1–12
- “Embedding tracking codes in additive manufactured parts for product authentication” In Advanced Engineering Materials 21.4 Wiley Online Library, 2019, pp. 1800495
- Chris Harrison, Robert Xiao and Scott Hudson “Acoustic barcodes: passive, durable and inexpensive notched identification tags” In Proceedings of the 25th annual ACM symposium on User interface software and technology, 2012, pp. 563–568
- “Embedding Information into or onto Additively Manufactured Parts: A Review of QR Codes, Steganography and Watermarking Methods” In Materials 15.7 MDPI, 2022, pp. 2596
- “Information Embedding for Secure Manufacturing: Challenges and Research Opportunities” In Journal of Computing and Information Science in Engineering 23.6 American Society of Mechanical Engineers Digital Collection, 2023
- Jin Sima, Netanel Raviv and Jehoshua Bruck “On coding over sliced information” In IEEE Transactions on Information Theory 67.5 IEEE, 2021, pp. 2793–2807
- Jin Sima, Netanel Raviv and Jehoshua Bruck “Robust indexing-optimal codes for DNA storage” In 2020 IEEE International Symposium on Information Theory (ISIT), 2020, pp. 717–722 IEEE
- “Coding over sets for DNA storage” In IEEE Transactions on Information Theory 66.4 IEEE, 2019, pp. 2331–2351
- “Torn-paper coding” In IEEE Transactions on Information Theory 67.12 IEEE, 2021, pp. 7904–7913
- “Communicating over the torn-paper channel” In GLOBECOM 2020-2020 IEEE Global Communications Conference, 2020, pp. 1–6 IEEE
- Aditya Narayan Ravi, Alireza Vahid and Ilan Shomorony “Capacity of the torn paper channel with lost pieces” In 2021 IEEE International Symposium on Information Theory (ISIT), 2021, pp. 1937–1942 IEEE
- Daniella Bar-Lev, Sagi Marcovich Eitan Yaakobi and Yonatan Yehezkeally “Adversarial torn-paper codes” In IEEE Transactions on Information Theory IEEE, 2023
- “Practical Break Resilient Codes in Forensic 3D Fingerprinting”, 2023
- V Levenshtein “Decoding automata invariant with respect to the initial state” In Problems of Cybernetics 12, 1964, pp. 125–136
- V Levenshtein “Maximum Number of Words in Codes without Overlaps” In Problemy Peredachi Informatsii 6.4, 1970, pp. 355–357
- E. Gilbert “Synchronization of binary messages” In IRE Transactions on Information Theory 6.4, 1960, pp. 470–477 DOI: 10.1109/TIT.1960.1057587
- “Distributed sequences and search process” In 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) 1, 2004, pp. 514–518 Vol.1 DOI: 10.1109/ICC.2004.1312542
- “A simple suboptimal construction of cross-bifix-free codes” In Cryptography and Communications 6.1, 2013, pp. 27–36 DOI: 10.1007/s12095-013-0088-8
- “Cross-Bifix-Free Codes Within a Constant Factor of Optimality” In IEEE Transactions on Information Theory 59.7, 2013, pp. 4668–4674 DOI: 10.1109/TIT.2013.2252952
- Stefano Bilotta, Elisa Pergola and Renzo Pinzani “A New Approach to Cross-Bifix-Free Sets” In IEEE Transactions on Information Theory 58.6, 2012, pp. 4058–4063 DOI: 10.1109/TIT.2012.2189479
- Simon R. Blackburn “Non-Overlapping Codes” In IEEE Transactions on Information Theory 61.9, 2015, pp. 4890–4894 DOI: 10.1109/TIT.2015.2456634
- “Q-Ary Non-Overlapping Codes: A Generating Function Approach” In IEEE Transactions on Information Theory 68.8, 2022, pp. 5154–5164 DOI: 10.1109/TIT.2022.3167845
- “A Rewritable, Random-Access DNA-Based Storage System” In Nature Scientific Reports 5.14138, 2015
- S.M.Hossein Tabatabaei Yazdi, Ryan Gabrys and Olgica Milenkovic “Portable and Error-Free DNA-Based Data Storage” In Nature Scientific Reports 7.5011, 2017
- “Mutually uncorrelated codes for DNA storage” In IEEE Transactions on Information Theory 65.6 IEEE, 2018, pp. 3671–3691
- “Deterministic document exchange protocols, and almost optimal binary codes for edit errors” In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, pp. 200–211 IEEE