A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
SIAM Journal on Discrete Mathematics
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Approximation algorithms
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The exact security of digital signatures-how to sign with RSA and Rabin
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Certifying authenticity via fiber-infused paper
ACM SIGecom Exchanges
RF-DNA: Radio-Frequency Certificates of Authenticity
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Quantum readout of physical unclonable functions
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Security analysis of image-based PUFs for anti-counterfeiting
CMS'12 Proceedings of the 13th IFIP TC 6/TC 11 international conference on Communications and Multimedia Security
Strong PUFs and their (physical) unpredictability: a case study with power PUFs
Proceedings of the Workshop on Embedded Systems Security
| Hi-index | 0.00 |
A certificate of authenticity (COA) is an inexpensivephysical object that has a random unique structure with a highcost of exact reproduction. An additional requirement is that theuniqueness of COA's random structure can be verified using aninexpensive device. Donald Bauder was the first to propose COA screated as a randomized augmentation of a set of fixed-length fibers into a transparent gluing material that fixes once for all the position of the fibers within. The statistics of the positioning of fibers is used as a source of randomness that is difficult to replicate.As oppose to recording authentic fiber-based COA structures in adatabase, we use public-key cryptography to authenticate COAs.During certification, the unique property of the physical objectis extracted, combined with an arbitrary text, signed with the private key of the issuer, and the signature is encoded andprinted as a barcode on the COA. Since the capacity of the barcodeis limited, the goal of any COA system is to contain in the signed message as much information about the random structure of the physical object as possible. In this paper, we show that the cost of forging a particular COA instance is exponentially proportional to the improvement in compressing COA's random features. Next, we formally define the compression objective, show that finding its optimal solution is an NP-hard problem, and propose a heuristic that improves significantly upon best standard compression methods.