Tight bounds for unconditional authentication protocols in the manual channel and shared key models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4117 LNCS, Issue , 2006, Pages 214-231

  Naor, Moni ^a   Segev, Gil ^a   Smith, Adam ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; ENTROPY; MATHEMATICAL MODELS; PROBABILITY; SECURITY SYSTEMS;

COMMUNICATION MODELS; SHARED KEY MODELS; UNCONDITIONAL AUTHENTICATION;

SECURITY OF DATA;

EID: 33749546005     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_13     Document Type: Conference Paper

References (20)

1. B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In 43rd FOCS, pages 345-355, 2002.
2. Bluetooth. http://www.bluetooth.com/bluetooth/.
3. Certified Wireless USB. http://www.usb.org/developers/wusb/.
4. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and non-malleable commitment. In 30th STOC, pages 141-150, 1998.
5. G. Di Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and non-interactive non-malleable commitment. In EUROCRYPT '01, pages 40-59, 2001.
6. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000.
7. C. Gehrmann. Cryptanalysis of the Gemmell and Naor multiround authentication protocol. In CRYPTO '94, pages 121-128, 1994.
8. C. Gehrmann, C. J. Mitchell, and K. Nyberg. Manual authentication for wireless devices. RSA Cryptobytes, 7:29-37, 2004.
9. P. Gemmell and M. Naor. Codes for interactive authentication. In CRYPTO '93, pages 355-367, 1993.
10. E. Gilbert, F. MacWilliams, and N. Sloane. Codes which detect deception. Bell System Technical Journal, 53(3):405-424, 1974.
11. R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In 30th FOCS, pages 230-235, 1989.
12. S. Laur, N. Asokan, and K. Nyberg. Efficient mutual data authentication using manually authenticated strings. Cryptology ePrint Archive, Report 2005/424, 2005.
13. U. M. Maurer. Authentication theory and hypothesis testing. IEEE Transactions on Information Theory, 46(4):1350-1356, 2000.
14. M. Naor and G. N. Rothblum. The complexity of online memory checking. In 46th FOCS, pages 573-584, 2005.
15. M. Naor, G. Segev, and A. Smith. Tight bounds for unconditional authentication protocols in the manual channel and shared key models. Cryptology ePrint Archive, Report 2006/175, 2006.
16. R. Pass and A. Rosen. New and improved constructions of non-malleable cryptographic protocols. In 37th STOC, pages 533-542, 2005.
17. G. J. Simmons. Authentication theory/coding theory. In CRYPTO '84, pages 411-431, 1984.
18. G. J. Simmons. The practice of authentication. In EUROCRYPT '85, pages 261-272, 1985.
19. S. Vaudenay. Secure communications over insecure channels based on short authenticated strings. In CRYPTO '05, pages 309-326, 2005.
20. M. N. Wegman and L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22(3):265-279, 1981.