Toward an automated verification of certificates of authenticity

Proceedings of the ACM Conference on Electronic Commerce

Volumn 5, Issue , 2004, Pages 160-169

  Kirovski, Darko ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Asymmetric traveling salesman problem; Certificates of authenticity; Point compression

Indexed keywords

BAR CODES; DATA COMPRESSION; ENCODING (SYMBOLS); HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; SECURITY OF DATA; SET THEORY;

ASYMMETRIC TRAVELING SALESMAN PROBLEM; CERTIFICATES OF AUTHENTICITY; POINT COMPRESSION;

CRYPTOGRAPHY;

EID: 3242793330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/988772.988797     Document Type: Conference Paper

References (19)

1. T. Andreae and H. Bandelt. Performance guarantees for approximation algorithms depending on parametrized triangle inequalities. SIAM Journal of Discrete Mathematics, Vol.8, pp.1-16, 1995.
2. D.W. Bauder. Personal Communication.
3. D.W. Bauder. An Anti-Counterfeiting Concept for Currency Systems. Research report PTK-11990. Sandia National Labs. Albuquerque, NM, 1983.
4. S. Church and D. Littman. Machine reading of Visual Counterfeit Deterrent Features and Summary of US Research, 1980-90. Four Nation Group on Advanced Counterfeit Deterrence, Ottawa, Canada, Septemeber 1991.
5. A.M. Frieze, G. Galbiati, and F. Maffioli. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks, Vol.12, no.1, pp.23-39, 1982.
6. M.R. Garey and D.S. Johnson. Computers and Intractability. San Francisco, CA: Freeman, 1979.
7. D.B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, Vol.24, no.1, pp.1-13, 1977.
8. A.J. Menezes, P.C. Van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
9. Commission on Engineering and Technical Systems (CETS). Counterfeit Deterrent Features for the Next-Generation Currency Design. The National Academic Press, 1993.
10. R. Pappu. Physical One-Way Functions. Ph.D. Thesis, MIT, 2001.
11. J. Rissanen. Modeling by Shortest Data Description. Automatica, Vol.14, pp.465-471, 1978.
12. R. L. Rivest, A. Shamir, and L. A. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, vol.21, no.2, pp.120-126, 1978.
13. C.E. Shannon. Prediction and entropy of printed English. Bell Systems Technical Journal, pp.50-64, 1951.
14. V.V. Vazirani. Approximation Algorithms. Springer, 2001.
15. I.H. Witten, A. Moffat, and T.C. Bell. Managing gigabytes: compressing and indexing documents and images. Morgan-Kaufmann, 1999.
16. Y. Desmedt and A. Odlyzko. A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes. CRYPTO, Springer-Verlag, pp.516-522, 1985.
17. D. Bleichenbacher. Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1. CRYPTO, Springer-Verlag, pp.1-12, 1998.
18. J.-S. Coron, D. Naccache, and J.P. Stern. A New Signature Forgery Strategy. CRYPTO, Springer-Verlag, pp.1-18, 1999.
19. M. Bellare and P. Rogaway. The exact security of digital signatures: how to sign with RSA and Rabin. EUROCRYPT, Springer-Verlag, pp.399-414, 1996.