Concealment and its applications to authenticated encryption

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

Volumn 2656, Issue , 2003, Pages 312-329

  Dodis, Yevgeniy ^a   An, Jee Hea ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b SoftMax Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; BANDWIDTH; BINDERS; BINS; HASH FUNCTIONS;

AUTHENTICATED ENCRYPTION; AUTHENTICATED ENCRYPTION SCHEME; COLLISION-RESISTANT HASH FUNCTIONS; EFFICIENT IMPLEMENTATION; FORMAL DEFINITION; GENERAL SOLUTIONS; ITS APPLICATIONS; LIMITED DEVICES;

CRYPTOGRAPHY;

EID: 35248852884     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_19     Document Type: Article

References (31)

1. J. AN AND M. BELLARE, "Constructing VIL-MACs from FIL-MACs: Message authentication under weakend assumptions," In Crypto '99, pp. 252-269, LNCS Vol. 1666, 1999.
2. J. AN, Y. DODIS, AND T. RABIN, "On the Security of Joint Signature and Encryption," In Eurocrypt '02, pp. 83-107, LNCS Vol. 2332, 2002.
3. J. BAEK, R. STEINFELD, AND Y. ZHENG, "Formal proofs for the security of signcryption," In PKC '02, pp. 80-98, LNCS Vol. 2274, 2002.
4. M. BELLARE, R. CANETTI AND H. KRAWCZYK, "Keying hash functions for message authentication," In Crypto '96, pp. 1-15, LNCS Vol. 1109, 1996.
5. M. BELLARE, J. KILIAN AND P. ROGAWAY, "The security of the cipher block chaining message authentication code," In Journal of Computer and System Sciences, pp. 362-399, Vol. 61, No. 3, Dec 2000.
6. M. BELLARE, T. KOHNO, C. NAMPREMPRE, "Provably Fixing the SSH Binary Packet Protocol," In Proc. 9th CCS, pp. 1-11, ACM, 2002.
7. M. BELLARE AND C. NAMPREMPRE, "Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm," In Asiacrypt '00, pp. 531-545, LNCS Vol. 1976, 2000.
8. M. BELLARE AND P. ROGAWAY, "Optimal asymmetric encryption - How to encrypt with RSA," In Eurocrypt '94, pp. 92-111, LNCS Vol. 950, 1994.
9. M. BELLARE AND P. ROGAWAY, "Collision-Resistant Hashing: Towards Making UOWHFs Practical," In Crypto '97, pp. 470-484, LNCS Vol. 1294, 1997.
10. M. BELLARE, P. ROGAWAY, "Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography," In Asiacrypt '00, pp. 317-330, LNCS Vol 1976, 2000.
11. J. BLACK, S. HALEVI, H. KRAWCZYK, T. KROVETZ AND P. ROGAWAY, "UMAC: Fast and secure message authentication," In Crypto '99, pp. 216-233, LNCS Vol. 1666, 1999.
12. M. BLAZE, "High-Bandwidth Encryption with Low-Bandwidth Smartcards," In Fast Software Encryption (FSE) '96, pp. 33-40, LNCS Vol. 1039, 1996.
13. M. BLAZE, J. FEIGENBAUM, M. NAOR, "A Formal Treatment of Remotely Keyed Encryption," In Eurocrypt '98, pp. 251-265, LNCS Vol. 1403, 1998.
14. I. DAMGÅRD, "Collision free hash functions and public key signature schemes," In Eurocrypt '87, pp. 203-216, LNCS Vol. 304, 1987.
15. Y. DODIS AND J. AN, "Concealment and its applications to authenticated encryption," Full version of this paper, available via http://theory.lcs.mit.edu/ ∼yevgen/academic.html.
16. C. JUTLA, "Encryption modes with almost free message integrity," In Eurocrypt '01, pp. 529-544, LNCS Vol. 2045, 2001.
17. M. JAKOBSSON, J. STERN, AND M. YUNG, "Scramble All, Encrypt Small," In Fast Software Encryption (FSE) '99, pp. 95-111, LNCS Vol. 1636, 1999.
18. J. KATZ AND M. YUNG, "Unforgeable Encryption and Chosen Ciphertext Secure Modes of Operation," In FSE '00, pp. 284-299, LNCS Vol. 1978, 2000.
19. H. KRAWCZYK, "The Order of Encryption .and Authentication for Protecting Communications (or: How Secure Is SSL?)," In Crypto '01, pp. 310-331, LNCS Vol. 2139, 2001.
20. S. LUCKS, "On the Security of Remotely Keyed Encryption," In Fast Software Encryption (FSE) '97, pp. 219-229, LNCS Vol. 1267, 1997.
21. S. LUCKS, "Accelerated Remotely Keyed Encryption," In Fast Software Encryption (FSE) '99, pp. 112-123, LNCS Vol. 1636, 1999.
22. A. MENEZES, P. VAN OORSHOT AND S. VANSTONE, "Handbook of applied cryptography," CRC Press LLC, 1997.
23. M. NAOR, "Bit Commitment Using Pseudorandomness," In Journal of Cryptology, 4(2):151-158, 1991.
24. M. NAOR AND M. YUNG, "Universal One-Way Hash Functions and their Cryptographic Applications," In Proc. 21st STOC, pp. 33-43, ACM, 1989.
25. P. ROGAWAY, "Authenticated-Encryption with Associated-Data," In Proc. 9th CCS, pp. 98-107, ACM, 2002.
26. P. ROGAWAY, M. BELLARE, J. BLACK, AND T. KROVETZ, "OCB: A Block-Cipher Mode of Operation for Efficient Authenticated Encryption," In Proc. 8th CCS, pp. 196-205, ACM, 2001.
27. J. ROMPEL, "One-way functions are necessary and sufficient for secure signatures," In Proc. 22nd STOC, pp. 387-394, ACM, 1990.
28. V. SHOUP, "A composition theorem for universal one-way hash functions," In Eurocrypt '00, pp. 445-452, LNCS Vol. 1807, 2000.
29. V. SHOUP, "A proposal for an ISO standard for public key encryption (version 2.1)," IACR E-Print Archive, 2001/112, http://eprint.iacr.org/2001/112/, 2001.
30. D. SIMON, "Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions?," In Eurocrypt '98, pp. 334-345, LNCS Vol. 1403, 1998.
31. Y. ZHENG, "Digital Signcryption or How to Achieve Cost(Signature & Encryption) ≪ Cost(Signature) + Cost (Encryption)," In Crypto '97, pp. 165-179, LNCS Vol. 1294, 1997.