FR2.R3.1

Break-Resilient Codes for Forensic 3D Fingerprinting

Canran Wang, Washington University in St. Louis, United States; Jin Sima, University of Illinois Urbana-Champaign, United States; Netanel Raviv, Washington University in St. Louis, United States

Session:
Combinatorial Coding Theory 3

Track:
1: Algebraic Aspects of Coding Theory

Location:
Ypsilon IV-V-VI

Presentation Time:
Fri, 12 Jul, 11:30 - 11:50

Session Chair:
Hiram Lopez,
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. This paper focuses on a special 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.
Resources