Incremental unforgeable encryption

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

Volumn 2355, Issue , 2002, Pages 109-124

  Buonanno, Enrico ^a   Katz, Jonathan ^a   Yung, Moti ^b  

^a Columbia University ^*  (United States)

^b CertCo Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AES BLOCK CIPHER; MODES OF OPERATION;

CRYPTOGRAPHY;

EID: 84958971416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45473-X_9     Document Type: Conference Paper

References (24)

1. ANSI X3.106, “American National Standard for Information Systems—Data Encryption Algorithm—Modes of Operation,” American National Standards Institute, 1983.
2. 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
3. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental Cryptography: The Case of Hashing and Signing. Crypto’94.
4. M. Bellare, O. Goldreich, and S. Goldwasser. Incremental Cryptography and Application to Virus Protection. STOC’95.
5. M. Bellare, J. Kilian, and P. Rogaway. On the Security of Cipher Block Chaining. CRYPTO’94.
6. M. Bellare and D. Micciancio. A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost. Eurocrypt’97.
7. M. Bellare and C. Namprempre. Authenticated Encryption: Relations Among Notions and Analysis of the Generic Composition Paradigm. Asiacrypt 2000.
8. M. Bellare and P. Rogaway. Encode-then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography. Asiacrypt 2000.
9. M. Blaze. A Cryptographic File System for Unix. 1st ACM Conference on Computer and Communications Security, 1993.
10. M. Fischlin. Incremental Cryptography and Memory Checkers. Eurocrypt’97.
11. M. Fischlin. Lower Bounds for the Signature Size of Incremental Schemes. FOCS’97.
12. V. Gligor and P. Donescu. Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes. FSE 2001.
13. O. Goldreich, S. Goldwasser, and S. Micali. How to Construct Random Functions. JACM 33(4): 792–807 (1986).
14. S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28: 270-299, 1984.
15. S. Halevi. An Observation Regarding Jutla’s Modes of Operation. Available at http://eprint.iacr.org/2001/015.
16. ISO 8372, “Information Processing—Modes of Operation for a 64-bit Block Cipher Algorithm,” International Organization for Standardization, Geneva, Switzerland, 1987.
17. C. S. Jutla. Encryption Modes withAlmost-F ree Message Integrity. Eurocrypt 2001, to appear. Also available at http://eprint.iacr.org.
18. J. Katz and M. Yung. Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. STOC 2000.
19. J. Katz and M. Yung. Unforgeability and Chosen-Ciphertext-Secure Modes of Operation. FSE 2000.
20. M. Luby. Pseudorandomness and Cryptographic Applications, Chapter 14. Princeton University Press, 1996.
21. D. Micciancio. Oblivious Data Structures: Applications to Cryptography. STOC’97.
22. See: http://www.nist.gov/modes.
23. National Bureau of Standards, NBS FIPS PUB 81, “DES Modes of Operation,” U.S. Department of Commerce, 1980.
24. P. Rogaway. OCB Mode: Parallelizable Authenticated Encryption. Available at [22].