A certificate of authenticity (COA) is an inexpensive physical object that has a random unique structure with high cost of near-exact reproduction. An additional requirement is that the uniqueness of COA's random structure can be verified using an inexpensive device. Bauder was the first to propose COA created as a randomized augmentation of a set of fixed-length fibers into a transparent gluing material that randomly fixes once for all the position of the fibers within. Recently, Kirovski (2004) showed that linear improvement in the compression ratio of a point-set compression algorithm used to store fibers' locations, yields exponential increase in the cost of forging a fiber-based COA instance. To address this issue, in this paper, we introduce a novel, generalized heuristic that compresses M points in an N-dimensional grid with computational complexity proportional to O(M/sup 2/). We compare its performance with an expected lower bound. The heuristic can be used for numerous other applications such as storage of biometric patterns.
[1]
R. Pappu,et al.
Physical One-Way Functions
,
2002,
Science.
[2]
J. Rissanen,et al.
Modeling By Shortest Data Description*
,
1978,
Autom..
[3]
Claude E. Shannon,et al.
Prediction and Entropy of Printed English
,
1951
.
[4]
Alfred Menezes,et al.
Handbook of Applied Cryptography
,
2018
.
[5]
Alfred Menezes,et al.
The Elliptic Curve Digital Signature Algorithm (ECDSA)
,
2001,
International Journal of Information Security.
[6]
Technical Systems,et al.
COMMISSION ON ENGINEERING AND TECHNICAL SYSTEMS
,
1999
.
[7]
Adi Shamir,et al.
A method for obtaining digital signatures and public-key cryptosystems
,
1978,
CACM.
[8]
Stephen A. Benton,et al.
Physical one-way functions
,
2001
.
[9]
Darko Kirovski.
Toward an automated verification of certificates of authenticity
,
2004,
EC '04.