EME*: Extending EME to handle arbitrary-length messages with associated data

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

Volumn 3348, Issue , 2004, Pages 315-327

  Halevi, Shai ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIT LENGTHS; BLOCK CIPHERS; BLOCK SIZES; BUILDING BLOCKES; MODE OF OPERATIONS;

CRYPTOGRAPHY;

EID: 33646717921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30556-9_25     Document Type: Article

References (19)

1. J. Black and P. Rogaway. CBC MACs for arbitrary-length messages: The three-key constructions. In Advances in Cryptology - CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 197-215. Springer-Verlag, 2000.
2. J. Black and P. Rogaway. A block-cipher mode of operation for parallelizable message authentication. In L. Knudsen, editor, Advances in Cryptology - EUROCRYPT '02, volume 2332 of Lecture Notes in Computer Science, pages 384-397. Springer-Verlag, 2002.
3. J. Black and P. Rogaway. Ciphers with arbitrary finite domains. In The RSA conference - Cryptographer's track, RSA-CT'02, volume 2271 of Lecture Notes in Computer Science, pages 114-130. Springer-Verlag, 2002.
4. S. Duplichan. A primitive polynomial search program. Web document. Available at http://users2.ev1.net/~sduplichan/primitivepolynomials/ primivitePolynomials.htm, 2003.
5. S. Even and Y. Mansour. A construction of a cipher from a single pseudorandom permutation. Journal of Cryptology, 10(3):151-162, 1997.
6. S. Goldwasser and S. Micali. "Probabilistic encryption". J. of Computer and System Sciences, 28, April 1984.
7. S. Halevi and P. Rogaway. A tweakable enciphering mode. In D. Boneh, editor, Advances in Cryptology - CRYPTO '03, volume 2729 of Lecture Notes in Computer Science, pages 482-499. Springer-Verlag, 2003. Full version available on the ePrint archive, http://eprint.iacr.org/2003/148/.
8. S. Halevi and P. Rogaway. A parallelizable enciphering mode. In The RSA conference - Cryptographer's track, RSA-CT'04, volume 2964 of Lecture Notes in Computer Science, pages 292-304. Springer-Velrag, 2004. Full version available on the ePrint archive, http://eprint.iacr.org/2003/147/.
9. S. Halevi. EME*: extending EME to handle arbitrary-length messages with associated data. In Indocrypt 2004. Full version available on the ePrint archive, http://eprint.iacr.org/2004/125/.
10. J. Kilian and P. Rogaway. How to protect DES against exhaustive key search. Journal of Cryptology, 14(1):17-35, 2001. Earlier version in CRYPTO '96. www.cs.ucdavis.edu/~rogaway.
11. M. Liskov, R. Rivest, and D. Wagner. Tweakable block ciphers. In Advances in Cryptology - CRYPTO '02, volume 2442 of Lecture Notes in Computer Science, pages 31-46. Springer-Verlag, 2002. www.cs.berkeley.edu/~daw/.
12. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2), April 1988.
13. D. A. McGrew and J. Viega. ABL mode: security without data expansion. Private communication, 2004.
14. M. Naor and O. Reingold. A pseudo-random encryption mode. Manuscript, available from www.wisdom.weizmann.ac.il/~naor/.
15. M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited. Journal of Cryptology, 12(1):29-66, 1999. (Earlier version in STOC '97.) Available from www.wisdom.weizmann.ac.il/~naor/.
16. n(1-ε) security. In Advances in Cryptology - CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 513-529. Springer-Verlag, 2003.
17. S. Patel, Z. Ramzan and G .Sundaram. Efficient Constructions of Variable-Input-Length Block Ciphers. In Selected Areas in Cryptography - SAC 2004, volume 3xxx of Lecture Notes in Computer Science, pages yyy-zzz. Springer-Verlag, 2004.
18. R. L. Rivest. The RC5 encryption algorithm. In Fast Software Encryption (FSE '94), volume 1008 of Lecture Notes in Computer Science, pages 86-96. Springer, 1994.
19. P. Rogaway. Efficient instantiations of tweakable block ciphers and refinements to modes OCB and PMAC. Available on-line from http://www.cs.ucdavis. edu/~rogaway/papers/, 2004.