Abstract
The recent selection of the AES block cipher to replace DES has generated interest in developing new modes of operation to supplement the modes defined as part of the DES standard [1,16,23]. We initiate the study of modes of encryption which are both incremental and unforgeable, and point out a number of applications for modes meeting these requirements. We also propose three specific modes achieving these goals, and discuss the strengths and weaknesses of each.
Chapter PDF
References
ANSI X3.106, “American National Standard for Information Systems—Data Encryption Algorithm—Modes of Operation,” American National Standards Institute, 1983.
M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation. FOCS’ 97.
M. Bellare, O. Goldreich, and S. Goldwasser. Incremental Cryptography: The Case of Hashing and Signing. Crypto’ 94.
M. Bellare, O. Goldreich, and S. Goldwasser. Incremental Cryptography and Application to Virus Protection. STOC’ 95.
M. Bellare, J. Kilian, and P. Rogaway. On the Security of Cipher Block Chaining. CRYPTO’ 94.
M. Bellare and D. Micciancio. A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. Eurocrypt’ 97.
M. Bellare and C. Namprempre. Authenticated Encryption: Relations Among Notions and Analysis of the Generic Composition Paradigm. Asiacrypt 2000.
M. Bellare and P. Rogaway. Encode-then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography. Asiacrypt 2000.
M. Blaze. A Cryptographic File System for Unix. 1st ACM Conference on Computer and Communications Security, 1993.
M. Fischlin. Incremental Cryptography and Memory Checkers. Eurocrypt’ 97.
M. Fischlin. Lower Bounds for the Signature Size of Incremental Schemes. FOCS’ 97.
V. Gligor and P. Donescu. Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes. FSE 2001.
O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. JACM 33(4): 792–807 (1986).
S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28: 270–299, 1984.
S. Halevi. An Observation Regarding Jutla’s Modes of Operation. Available at http://eprint.iacr.org/2001/015.
ISO 8372, “Information Processing—Modes of Operation for a 64-bit Block Cipher Algorithm,” International Organization for Standardization, Geneva, Switzerland, 1987.
C. S. Jutla. Encryption Modes with Almost-Free Message Integrity. Eurocrypt 2001, to appear. Also available at http://eprint.iacr.org.
J. Katz and M. Yung. Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. STOC 2000.
J. Katz and M. Yung. Unforgeability and Chosen-Ciphertext-Secure Modes of Operation. FSE 2000.
M. Luby. Pseudorandomness and Cryptographic Applications, Chapter 14. Princeton University Press, 1996.
D. Micciancio. Oblivious Data Structures: Applications to Cryptography. STOC’ 97.
National Bureau of Standards, NBS FIPS PUB 81, “DES Modes of Operation,” U.S. Department of Commerce, 1980.
P. Rogaway. OCB Mode: Parallelizable Authenticated Encryption. Available at [22].
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buonanno, E., Katz, J., Yung, M. (2002). Incremental Unforgeable Encryption. In: Matsui, M. (eds) Fast Software Encryption. FSE 2001. Lecture Notes in Computer Science, vol 2355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45473-X_9
Download citation
DOI: https://doi.org/10.1007/3-540-45473-X_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43869-4
Online ISBN: 978-3-540-45473-1
eBook Packages: Springer Book Archive