How to enrich the message space of a cipher

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

Volumn 4593 LNCS, Issue , 2007, Pages 101-118

  Ristenpart, Thomas ^a   Rogaway, Phillip ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Deterministic encryption; Enciphering scheme; Length preserving encryption; Multipermutation; Symmetric encryption

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

DETERMINISTIC ENCRYPTION; LENGTH PRESERVING ENCRYPTION; SYMMETRIC ENCRYPTION;

MESSAGE PASSING;

EID: 35348931588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74619-5_7     Document Type: Conference Paper

References (31)

1. An, J., Bellare, M.: Constructing VIL-MACs from FIL-MACs: Message authentication under weakened assumptions. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 252-269. Springer, Heidelberg (1999)
2. Anderson, R., Biham, E.: Two practical and provably secure block ciphers: BEAR and LION. In: Gollmann, D. (ed.) Fast Software Encryption. LNCS, vol. 1039, pp. 113-120. Springer, Heidelberg (1996)
3. Bellare, M., Rogaway, P.: On the construction of variable-input-length ciphers. In: Knudsen, L.R. (ed.) FSE 1999. LNCS, vol. 1636, pp. 231-244. Springer, Heidelberg (1999)
4. Bellare, M., Rogaway, P.: Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography. In: Okamoto, T. (ed.) ASI-ACRYPT 2000. LNCS, vol. 1976, pp. 317-330. Springer, Heidelberg (2000)
5. Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409-426. Springer, Heidelberg (2006)
6. Black, J., Rogaway, P.: Ciphers with arbitrary finite domains. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 114-130. Springer, Heidelberg (2002)
7. Cayley, A.: On Latin squares. Oxford Cambridge Dublin Messenger Math. 19, 135-137 (1890)
8. Chakraborty, D., Sarkar, P.: A new mode of encryption providing a strong tweakable pseudo-random permutation. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 293-309. Springer, Heidelberg (2006)
9. Chakraborty, D., Sarkar, P.: HCH: A new tweakable enciphering scheme using the Hash-Encrypt-Hash approach. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 287-302. Springer, Heidelberg (2006)
10. Cook, D., Yung, M., Keromytis, A.: Elastic AES. Cryptology ePrint archive, report 2004/141 (2004)
11. Cook, D., Yung, M., Keromytis, A.: Elastic block ciphers. Cryptology ePrint archive, report 2004/128 (2004)
12. Halevi, S.: EME*: Extending EME to handle arbitrary-length messages with associated data. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 315-327. Springer, Heidelberg (2004)
13. Halevi, S.: TET: A wide-block tweakable mode based on Naor-Reingold. Cryptology ePrint archive, report 20007/14 (2007)
14. Halevi, S., Rogaway, P.: A parallelizable enciphering mode. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 292-304. Springer, Heidelberg (2004)
15. Halevi, S., Rogaway, P.: A tweakable enciphering mode. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 482-499. Springer, Heidelberg (2003)
16. Liskov, M., Rivest, R., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 31-46. Springer, Heidelberg (2002)
17. Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17(2), 373-386 (1988)
18. Lucks, S.: BEAST: A fast block cipher for arbitrary blocksizes. In: Communications and Multimedia Security, IFIP, vol. 70, pp. 144-153. Chapman & Hill, Sydney, Australia (1996)
19. Lucks, S.: Faster Luby-Rackoff ciphers. In: Gollmann, D. (ed.) Fast Software Encryption. LNCS, vol. 1039, pp. 189-203. Springer, Heidelberg (1996)
20. McGrew, D., Fluhrer, S.: The extended codebook (XCB) mode of operation. Cryptology ePrint archive, report 2004/278 (2004)
21. Meyer, C., Matyas, M.: Cryptography: A New Dimension in Data Security. John Wiley & Sons, New York (1982)
22. Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology 12(1), 29-66 (1999)
23. Patarin, J.: How to construct pseudorandom and super pseudorandom permutations from one single pseudorandom function. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 256-266. Springer, Heidelberg (1993)
24. Patel, S., Ramzan, Z., Sundaram, G.: Efficient constructions of variable-input-length block ciphers. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 326-340. Springer, Heidelberg (2004)
25. Ristenpart, T., Rogaway, P.: How to enrich the Message Space of a Cipher (full version of this paper), http://www.cse.ucsd.edu/users/tristenp/
26. Schneier, B., Kelsey, J.: Unbalanced Feistel networks and block cipher design. In: Gollmann, D. (ed.) Fast Software Encryption. LNCS, vol. 1039, pp. 121-144. Springer, Heidelberg (1996)
27. Schnorr, C., Vaudenay, S.: Black box cryptanalysis of hash networks based on multipermutations. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 47-57. Springer, Heidelberg (1995)
28. Schroeppel, R.: Hasty pudding cipher specification. First AES Candidate Workshop (1998)
29. Vaudenay, S.: On the need for multipermutations: cryptanalysis of MD4 and SAFER. In: Preneel, B. (ed.) Fast Software Encryption. LNCS, vol. 1008, pp. 286-297. Springer, Heidelberg (1995)
30. Wang, P., Feng, D., Wu, W.: HCTR: a variable-input-length enciphering mode. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol. 3822, pp. 175-188. Springer, Heidelberg (2005)
31. Zheng, Y., Matsumoto, T., Imai, H.: On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 461-480. Springer, Heidelberg (1990)