An optimal non-interactive message authentication protocol

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

Volumn 3960 LNCS, Issue , 2006, Pages 280-294

  Pasini, Sylvain ^a   Vaudenay, Serge ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FUNCTION EVALUATION; SECURITY OF DATA; HASH FUNCTIONS;

COMMUNICATION MODEL; HASH FUNCTION; NON-INTERACTIVE MESSAGE AUTHENTICATION PROTOCOLS (NIMAP); SHORT AUTHENTICATED STRINGS (SAS);

NETWORK PROTOCOLS; AUTHENTICATION;

AUTHENTICATED CHANNEL; COLLISION-RESISTANT HASH FUNCTIONS; COMMUNICATION MODELING; INTERACTIVE MESSAGE; MESSAGE AUTHENTICATION PROTOCOLS; OPTIMALITY; UNIVERSAL HASH FUNCTION FAMILY;

EID: 33745637238     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605805_18     Document Type: Conference Paper

References (18)

1. [BCC88] Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2): 156-189, 1988.
2. [BCJ+05] Eli Biham, Rafi Chen, Antoine Joux, Patrick Carribault, Christophe Lemuel, and William Jalby. Collisions of SHA-0 and reduced SHA-1. In Advances in Cryptology - EUROCRYPT '05: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lecture Notes in Computer Science, pages 36-57. Aarhus, Denmark, 2005. Springer-Verlag.
3. [BK90] Joan F. Boyar and Stuart A. Kurtz. A discrete logarithm implementation of perfect zero-knowledge blobs. Journal of Cryptology, 2(2):63-76, 1990.
4. [BR93] Mihir Bellare and Phillip Rogaway. Entity authentication and key distribution. In Douglas R. Stinson, editor, Advances in Cryptology - CRYPTO '93: 13th Annual International Cryptology Conference, volume 773 of Lecture Notes in Computer Science. pages 232-249, Santa Barbara. California, U.S.A., 1993. Springer-Verlag.
5. [BSSW02] Dirk Balfanz, Diana K. Smetters, Paul Stewart, and H. Chi Wong. Talking to slrangers: Authentication in ad-hoc wireless networks. In Proceedings of Network and Distributed System Security Symposium 2002 (NDSS'02), San Diego, California, U.S.A. February 2002.
6. [CGHGN01] Dario Caialano, Rosario Gennaro, Nick Howgrave-Graham, and Phong Q. Nguyen. Paillier's cryplosysiem revisiled. In CCS '01: Proceedings of the 8th ACM conference on Computer and Communications Security, pages 206-214, Philadelphia, Pennsylvania, U.S.A., 2001. ACM Press.
7. [DG03] Ivan Damgård and Jens Grolh. Non-inleraclive and reusable non-malleable commilmenl schemes. In STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 426-437, San Diego, California, U.S.A., 2003. ACM Press.
8. [GMN04] Christian Gehrmann, Chris J. Milchell, and Kaisa Nyberg. Manual aulhenlicalion for wireless devices. RSA Cryptobytes, 7(1):29-37, January 2004.
9. [LdW05] Arjen K. Lensira and Benne de Weger. On ihe possibilily of conslrucling meaningful hash collisions for public keys. In Colin Boyd and Juan Manuel Gonzalez Nielo, editors, ACISP '05: The 10th Australasian Conference on Information Security and Privacy, volume 3574 of Lecture Notes in Computer Science, pages 267-279, Brisbane, Auslralia, 2005. Springer-Verlag.
10. [LWdW05] Arjen Lensira, Xiaoyun Wang, and Benne de Weger. Colliding X.509 certificates. Cryptology ePrinl Archive, Report 2005/067, 2005.http://eprint. iacr.org/.
11. [Pai99] Pascal Paillier. Public-key cryptosystems based on composite degree residuosily classes. In Jacques Stern, edilor, Advances in Cryptology - EUROCRYPT '99: International Conference on the Theory and Application of Cryptographic Techniques, volume 1592 of Lecture Notes in Computer Science, pages 223-238, Prague, Czech Republic, May 1999. Springer.
12. [Pas05] Sylvain Pasini. Secure communicalions over insecure channels using an aulhenticated channel. Master's thesis, Swiss Federal Institule of Technology (EPFL), 2005. http://lasecwww.epfl.ch/php-code/publications/search. php?ref=Pas05.
13. [Riv92] Ronald L. Rivest. The MD5 message digesi algorithm. Technical Report Internet RFC-1321,IETF, 1992.
14. [Vau05] Serge Vaudenay. Secure communications over insecure channels based on short authenticated strings. In Victor Shoup, editor, Advances in Cryptology - CRYPTO '05: The 25th Annual International Cryptology Conference, volume 3621 of Lecture Notes in Computer Science, pages 309-326, Santa Barbara, California, U.S.A., August 2005. Springer-Verlag.
15. [WLF+05] Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen, and Xiuyuan Yu. Cryptanalysis of the hash functions MD4 and RIPEMD. In Ronald Cramer, editor, Advances in Cryptology - EUROCRYPT '05: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lecture Notes in Computer Science, pages 1-18, Aarhus, Denmark, 2005. Springer-Verlag.
16. [WY05] Xiaoyun Wang and Hongbo Yu. How to break MD5 and other hash functions. In Ronald Cramer, editor, Advances in Cryptology - EUROCRYPT '05: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lecture Notes in Computer Science, pages 19-35, Aarhus, Denmark, 2005. Springer-Verlag.
17. [WYY05a] Xiaoyun Wang, Yiqun Yin, and Hongbo Yu. Finding collisions in the full SHA1. In Victor Shoup, editor. Advances in Cryptology - CRYPTO '05: The 25th Annual International Cryptology Conference, volume 3621 of Lecture Notes in Computer Science, pages 17-36, Santa Barbara. California, U.S.A., 2005. Springer-Verlag.
18. [WYY05b] Xiaoyun Wang, Xiuyuan Yu, and L. Y. Yin. Efficient collision search attackson SHA0. In Victor Shoup, editor, Advances in Cryptology- CRYPTO'05: The 25th Annual International Cryptology Conference, volume 3621 of Lecture Notes in Computer Science, pages 1-16, Santa Barbara, California, U.S.A., 2005. Springer-Verlag.