Does encryption with redundancy provide authenticity?

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

Volumn 2045, Issue , 2001, Pages 512-528

  An, Jee Hea ^a   Bellare, Mihir ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

REDUNDANCY;

ENCRYPTION SCHEMES; REDUNDANCY SCHEME;

CRYPTOGRAPHY;

EID: 84945121341     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44987-6_31     Document Type: Article

References (27)

1. J. An and M. Bellare, “Does encryption with redundancy provide authenticity?” Full version of this paper, available via http://www-cse.ucsd.edu/users/mihir.
2. M. Atici and D. Stinson, “Universal Hashing and Multiple Authentication”, Advances in Cryptology - CRYPTO ‘96, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996.
3. M. Bellare, R. Canetti and H. Krawczyk, “Keying hash functions for message authentication,” Advances in Cryptology - CRYPTO ‘96, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed., Springer-Verlag, 1996.
4. M. Bellare, A. Desai, E. Jokipii and P. Rogaway, “A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation,” Proc. of the 38th IEEE FOCS, IEEE, 1997.
5. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, “Relations among notions of security for public-key encryption schemes,” Advances in Cryptology - CRYPTO ‘98, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk ed., Springer-Verlag, 1998.
6. M. Bellare, J. Kilian and P. Rogaway, “The Security of the Cipher Block Chaining Message Authentication Code,” Journal of Computer and System Sciences, Vol. 61, No. 3, December 2000, pp. 362-399.
7. M. Bellare and C. Namprempre, “Authenticated Encryption: Relations among notions and analysis of the generic composition paradigm,” Advances in Cryptology - ASIACRYPT ‘00, Lecture Notes in Computer Science Vol. 1976, T. Okamoto ed., Springer-Verlag, 2000.
8. M. Bellare and P. Rogaway, “Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography,” Advances in Cryptology - ASIACRYPT ‘00, Lecture Notes in Computer Science Vol. 1976, T. Okamoto ed., Springer-Verlag, 2000.
9. M. Bellare and A. Sahai, “Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-Based Characterization,” Advances in Cryptology - CRYPTO ‘99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999.
10. J. Black, S. Halevi, H. Krawczyk, T. Krovetz and P. Rogaway, “UMAC: Fast and secure message authentication,” Advances in Cryptology- CRYPTO ‘99, Lecture Notes in Computer Science Vol. 1666, M. Wiener ed., Springer-Verlag, 1999.
11. L. Carter and M. Wegman, “Universal Classes of Hash Functions,” Journal of Computer and System Sciences, Vol. 18, 1979, pp. 143-154.
12. D. Dolev, C. Dwork and M. Naor, “Non-malleable cryptography,” Proc. of the 23rd ACM STOC, ACM, 1991.
13. S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Sciences, Vol. 28, 1984, pp. 270-299.
14. S. Halevi and H. Krawczyk, “MMH: Software Message Authentication in the Gbit/Second Rates,” Fast Software Encryption — 4th International Workshop, FSE’97Proceedings, Lecture Notes in Computer Science, vol. 1267, E. Biham ed., Springer, 1997.
15. R. Jueneman, “A high speed manipulation detection code,” Advances in Cryp-tology - CRYPTO ‘86, Lecture Notes in Computer Science Vol. 263, A. Odlyzko ed., Springer-Verlag, 1986.
16. R. Jueneman, C. Meyer and S. Matyas, “Message Authentication with Manipulation Detection Codes,” in Proceedings of the 1983 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 1984, pp.33-54.
17. C. Jutla, “Encryption modes with almost free message integrity,” Report 2000/039, Cryptology ePrint Archive, http://eprint.iacr.org/, August 2000.
18. J. Katz and M. Yung, “Complete characterization of security notions for probabilistic private-key encryption,” Proc. of the 32nd ACM STOC, ACM, 2000.
19. J. Katz and M. Yung, “Unforgeable Encryption and Adaptively Secure Modes of Operation,” Fast Software Encryption ‘00, Lecture Notes in Computer Science, B. Schneier ed., Springer-Verlag, 2000.
20. H. Krawczyk, “LFSR-based Hashing and Authentication,” Advances in Cryptology - CRYPTO ‘94, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
21. H. Krawczyk, “The order of encryption and authentication for protecting communications (Or: how secure is SSL?),” Manuscript, 2001.
22. M. Luby and C. Rackoff, “How to Construct Pseudorandom Permutations from Pseudorandom Functions,” SIAM Journal of Computing, Vol. 17, No. 2, pp. 373-386, April 1988.
23. A. Menezes, P. van Oorshot and S. Vanstone, “Handbook of applied cryptography,” CRC Press LLC, 1997.
24. B. Preneel, “Cryptographic Primitives for Information Authentication — State of the Art,” State of the Art in Applied Cryptography, COSIC’97, LNCS 1528, B. Preneel and V. Rijmen eds., Springer-Verlag, pp. 49-104, 1998.
25. P. Rogaway, “Bucket Hashing and its Application to Fast Message Authentication,” Advances in Cryptology - CRYPTO ‘95, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
26. P. Rogaway, “OCB mode: Parallelizable authenticated encryption,” Presented in NIST’s workshop on modes ofoperations, October, 2000. See http://csrc.nist.gov/encryption/modes/workshop1/
27. M. Wegman and L. Carter, “New hash functions and their use in authentication and set equality,” Journal of Computer and System Sciences, Vol. 22, 1981, pp. 265-279.