Invertible universal hashing and the TET encryption mode

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

Volumn 4622 LNCS, Issue , 2007, Pages 412-429

  Halevi, Shai ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; MESSAGE PASSING; POLYNOMIAL APPROXIMATION;

BLOCK CIPHER; INVERTIBLE UNIVERSAL HASHING;

CRYPTOGRAPHY;

EID: 38049131758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_23     Document Type: Conference Paper

References (18)

1. 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)
2. Chakraborty, D., Sarkar, P.: A new mode of encryption providing a tweakable strong pseudo-random permutation. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 293-309. Springer, Heidelberg (2006)
3. Fluhrer, S.R., McGrew, D.A.: The extended codebook (XCB) mode of operation. Technical Report, 2007/278, IACR ePrint archive (2004) http://eprint.iacr.org/2004/278/
4. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270-299 (1984)
5. 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)
6. Halevi, S.: Invertible Universal Hashing and the TET Encryption Mode. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 412-429. Springer, Heidelberg (2007) Long version available on-line at, http://eprint.iacr.org/ 2007/014/
7. Halevi, S., Rogaway, P.: A tweakable enciphering mode. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 482-499. Springer, Heidelberg (2003)
8. Halevi, S., Rogaway, P.: A parallelizable enciphering mode. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 292-304. Springer, Heidelberg (2004)
9. Iwata, T., Kurosawa, K.: OMAC: One-Key CBC MAC. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 129-153. Springer, Heidelberg (2003)
10. Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17(2) (1988)
11. Liskov, M., Rivest, R.L., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 31-46. Springer, Heidelberg (2002)
12. Meyr, C.H., Matyas, S.M.: Cryptography: A New Dimension in Computer Data Security. John Wiley & Sons, Chichester (1982)
13. McGrew, D.A., Viega, J.: Arbitrary block length mode. Manuscript (2004) Available on-line from http://grouper.ieee.org/groups/1619/email/pdf00005.pdf
14. Naor, M., Reingold, O.: A pseudo-random encryption mode (1997) Manuscript available from http://www.wisdom.weizmann.ac.il/~naor/
15. Naor, M., Reingold, O.: On the construction of pseudo-random permutations: Luby-Rackoff revisited. Journal of Cryptology 12(1), 29-66 (1999)
16. Shoup, V.: On fast and provably secure message authentication based on universal hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 74-85. Springer, Heidelberg (1996)
17. 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)
18. Yang, B., Mishra, S., Karri, R.: A High Speed Architecture for Galois/Counter Mode of Operation (GCM). Technical Report, 2005/146, IACR ePrint archive (2005), http://eprint.iacr.org/2005/146/