Secure object identification - Or: Solving the chess grandmaster problem

Proceedings New Security Paradigms Workshop

Volumn , Issue , 2004, Pages 77-85

  Alkassar, Ammar ^a   Stable, Christian ^a   Sadeghi, Ahmad Reza ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Chessmaster Problem; Fake equipment; Identification; Mafia fraud

Indexed keywords

AUTOMATION; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PERSONAL DIGITAL ASSISTANTS; PROBABILITY; REAL TIME SYSTEMS; SECURITY OF DATA;

CHESSMASTER PROBLEM; FAKE EQUIPMENT; IDENTIFICATION; MAFIA FRAUD;

CRYPTOGRAPHY;

EID: 17644398259     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. A. Alkassar and C. Stüble. Towards secure IFF: preventing mafia fraud attacks. In MILCOM 2002. 21st Century Military Communications Conference, volume 2, pages 1139-1144, Anaheim, CA, Oct. 2002. IEEE.
2. R. J. Anderson. Security Engineering -A Guide to Building Dependable Distributed Systems. John Wiley & Sons, 2001.
3. W. A. Arbaugh, D. J. Farber, and J. M. Smith. Reliable bootstrap architecture. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 65-71, Oakland, CA, May 1997. IEEE Computer Society, Technical Committee on Security and Privacy, IEEE Computer Society Press.
4. W. A. Arbaugh, A. D. Keromytis, D. J. Farber, and J. M. Smith. Automated recovery in a secure bootstrap process. In Proceedings of the Symposium on Network and Distributed Systems Security (NDSS '98), pages 155-167, San Diego, California, Mar. 1998. Internet Society.
5. M. Bellare, M. Fischlin, S. Goldwasser, and S. Micali. Identification protocols secure against reset attacks. In B. Pfitzmann, editor, Advances in Cryptology EUROCRYPT '2001, volume 2045 of Lecture Notes in Computer Science, pages 493-508, Innsbruck, Austria, 2001. Springer-Verlag, Berlin Germany.
6. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In V. Ashby, editor, Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62-73, Fairfax, Virginia, Nov. 1993. ACM Press.
7. M. Bellare and P. Rogaway. Entity authentication and key distribution. In D. R. Stinson, editor, Advances in Cryptology - CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 232-249. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1994.
8. S. Bengio, G. Brassard, Y. G. Desmedt, C. Goutier, and J.-J. Quisquater. Secure implementation of identification systems. Journal of Cryptology, 4(3):175-183, 1991.
9. T. Beth and Y. Desmedt. Identification tokens - or: Solving the chess grandmaster problem. In A. Menezes and S. Vanstone, editors, Advances in Cryptology CRYPTO '90, volume 537 of Lecture Notes in Computer Science, pages 169-176. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1991.
10. S. Brands and D. Chaum. Distance-bounding protocols. In T. Helleseth, editor, Advances in Cryptology - EUROCRYPT '93, volume 765 of Lecture Notes in Computer Science, pages 344-359. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1994.
11. D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In D. Chaum and W. L. Price, editors, Advances in Cryptology - EUROCRYPT '87, volume 304 of Lecture Notes in Computer Science, pages 127-141. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1988.
12. D. J. Chiang, M. C. Zari, C. S. Anderson, A. F. Zwilling, J. W. Fikes, D. A. Hess, and R. N. Ward. Personnel identification system utilizing low probability of intercept techniques for covert operations. Security Technology, 1996. 30th Annual 1996 International Carnahan Conference, 1996.
13. J. H. Conway. On numbers and games. Academic Press, London, U.K., 1976.
14. D. E. Denning and P. F. MacDoran. Location-based authentication: Grounding cyberspace for better security. In D. E. Denning and P. J. Denning, editors, Internet Besieged: Countering Cyberspace Scofflaws, pages 167-174. ACM Press / Addison-Wesley, New York, 1998. Reprint from Computer Fraud and Security, Elsevier Science, Ltd, February 1996.
15. Y. Desmedt. Major security problems with the 'unforgeable' (feige)-fiat-shamir proofs of identity and how to overcome them. In SecuriCom '88, SEDEP Paris, France, 1988.
16. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000. A preliminary version appeared in 23rst STOC, 1991.
17. C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. 30th Symposium on Theory of Computing (STOC) 1998, ACM, New York 1998, 409-418.
18. U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. Journal of Cryptology, 1(2):77-94, 1988.
19. U. Feige and A. Shamir. Witness indistinguishable and witness hiding protocols. In Proceedings of the 22nd Annual Symposium on Theory of Computing (STOC), pages 416-426, Baltimore, MD, USA, May 1990. ACM Press.
20. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In A. M. Odlyzko, editor, Advances in Cryptology - CRYPTO '86, volume 263 of Lecture Notes in Computer Science, pages 186-194, Santa Barbara, CA, USA, 1987. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany.
21. O. Goldreich. Foundations of Cryptography, volume Basic Tools. Cambridge University Press, 2001.
22. N. Ikram and S. J. Shepherd. A new approach towards secure IFF techniques. In IEEE Military Communications Conference (MILCOM '98), pages 18-21, Boston, Massachusetts, Oct. 1998.
23. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press series on discrete mathematics and its applications. CRC Press, 1997. ISBN 0-8493-8523-7.
24. T. Okamoto. Provably secure and practical identification schemes and corresponding signature schemes. In E. Brickell, editor, Advances in Cryptology - CRYPTO '92, volume 740 of Lecture Notes in Computer Science, pages 31-44. International Association for Cryptologic Research, Springer-Verlag, Berlin Germany, 1993.
25. B. Pfitzmann, J. Riordan, C. Stüble, M. Waidner, and A. Weber. The PERSEUS system architecture. Technical Report RZ 3335 (#93381), IBM Research Division, Zurich Laboratory, Apr. 2001.
26. B. Pfitzmann, M. Schunter, and M. Waidner. Cryptographic security of reactive systems. Electronic Notes in Theoretical Computer Science (ENTCS), 32, 2000. Workshop on Secure Architectures and Information Flow, Royal Holloway, University of London, December 1-3, 1999.
27. D. Schilling, R. Pickholz, and L. Milstein. Spread spectrum goes commercial. IEEE Spectrum, pages 41-45, Aug. 1990.
28. C. P. Schnorr. Efficient signature generation by smart cards. Journal of Cryptology, 4(3):161-174, 1991.
29. V. Shoup. On formal models for secure key exchange. Research Report RZ 3120 (#93166), IBM Research, Apr. 1999. A revised version 4, dated November 15, 1999, is available from http://www.shoup.net/papers/.