Unconditionally Secure Authenticated Encryption with Shorter Keys

Confidentiality and integrity are two main objectives of security systems and the literature of cryptography is rich with proposed techniques to achieve them. To satisfy the requirements of a wide range of applications, a variety of techniques with different properties and performances have appeared in the literature. In this work, we address the problem of confidentiality and integrity in communications over public channels. We propose an unconditionally secure authenticated encryption that requires shorter key material than current state of the art. By combining properties of the integer field Zp with the fact that the message to be authenticated is unknown to adversaries (encrypted), message integrity is achieved using a single modular multiplication. Against an adversary equipped with a single antenna, the adversary’s probability of modifying a valid message in a way undetected by the intended receiver can be made an absolute zero. After the description of the basic scheme and its detailed security analysis are completed, we describe an extension to the main scheme that can substantially reduce the required amount of key material.

[1]  Phillip Rogaway,et al.  Proposal to NIST for a parallelizable message authentication code , 2001 .

[2]  Virgil D. Gligor,et al.  Integrity-Aware PCBC Encryption Schemes , 1999, Security Protocols Workshop.

[3]  Hugo Krawczyk,et al.  The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?) , 2001, CRYPTO.

[4]  Virgil D. Gligor,et al.  Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes , 2001, FSE.

[5]  Hugo Krawczyk,et al.  Keying Hash Functions for Message Authentication , 1996, CRYPTO.

[6]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[7]  Hugo Krawczyk,et al.  UMAC: Fast and Secure Message Authentication , 1999, CRYPTO.

[8]  Srdjan Capkun,et al.  Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).

[9]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[10]  Abraham Bookstein,et al.  Cryptography: A new dimension in computer data security ? and ?. Wiley-Interscience, New York (1982). xxi + 775 pp., $43.95. ISBN 0471-04892-5. , 1985 .

[11]  Randall J. Atkinson,et al.  IP Encapsulating Security Payload (ESP) , 1995, RFC.

[12]  Tatu Ylönen,et al.  The Secure Shell (ssh) Transport Layer Protocol , 2006 .

[13]  Larry Carter,et al.  New classes and applications of hash functions , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[14]  Mihir Bellare,et al.  The EAX Mode of Operation , 2004, FSE.

[15]  Gray De Bureau of standards. , 1989 .

[16]  Gerhard Goos,et al.  Fast Software Encryption , 2001, Lecture Notes in Computer Science.

[17]  Hugo Krawczyk,et al.  Message Authentication using Hash Functions , 1996 .

[18]  Tadayoshi Kohno,et al.  CWC: A High-Performance Conventional Authenticated Encryption Mode , 2004, FSE.

[19]  Mihir Bellare,et al.  XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions , 1995, CRYPTO.

[20]  John T. Kohl,et al.  The Kerberos Network Authentication Service (V5 , 2004 .

[21]  Neal Koblitz,et al.  Advances in Cryptology — CRYPTO ’96 , 2001, Lecture Notes in Computer Science.

[22]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[23]  Bruce Schneier,et al.  Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive , 2003, FSE.

[24]  Bruce Christianson Security protocols : 7th International Workshop, Cambridge, UK, April 19-21, 1999 : proceedings , 2000 .

[25]  Chanathip Namprempre,et al.  Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm , 2000, Journal of Cryptology.

[26]  John Black,et al.  PMAC: A Parallelizable Message Authentication Code , 2001 .

[27]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[28]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[29]  Charanjit S. Jutla Encryption Modes with Almost Free Message Integrity , 2001, EUROCRYPT.

[30]  Aggelos Kiayias,et al.  Self Protecting Pirates and Black-Box Traitor Tracing , 2001, CRYPTO.