Online ciphers from tweakable blockciphers

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

Volumn 6558 LNCS, Issue , 2011, Pages 237-249

  Rogaway, Phillip ^a   Zhang, Haibin ^a  

^a Davis   (United States)

Author keywords

modes of operation; Online ciphers; provable security; symmetric encryption; tweakable blockciphers

Indexed keywords

MODES OF OPERATION; ONLINE CIPHERS; PROVABLE SECURITY; SYMMETRIC ENCRYPTION; TWEAKABLE BLOCKCIPHERS;

CRYPTOGRAPHY;

EID: 79951784877     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19074-2_16     Document Type: Conference Paper

References (24)

1. Amanatidis, G., Boldyreva, A., O'Neill, A.: Provably-secure schemes for basic query support in outsourced databases. In: Barker, S., Ahn, G.-J. (eds.) Data and Applications Security 2007. LNCS, vol. 4602, pp. 14-30. Springer, Heidelberg (2007)
2. Bard, G.: A challenging but feasible blockwise-adaptive chosen-plaintext attack on SSL. In: International Conference on Security and Cryptography, SECRYPT 2006, pp. 99-109. INSTICC Press (2006)
3. Bellare, M., Boldyreva, A., Knudsen, L., Namprempre, C.: On-line ciphers and the hash-CBC constructions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 292-309. Springer, Heidelberg (2001)
4. Bellare, M., Boldyreva, A., Knudsen, L., Namprempre, C.: On-line ciphers and the hash-CBC constructions. Cryptology ePrint report 2007/197, June 29 (2007) Full version of [3]
5. Bellare, M., Ristenpart, T., Rogaway, P., Stegers, T.: Format preserving encryption. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 295-312. Springer, Heidelberg (2009)
6. Bellare, M., Rogaway, P.: Code-based game-playing proofs and the security of triple encryption. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409- 426. Springer, Heidelberg (2006)
7. Bellare, M., Rogaway, P., Spies, T.: The FFX mode of operation for format-preserving encryption (draft 1.1). NIST submission (February 2010); See also the addendum (September 2010) by the same authors
8. Bernstein, D., Schwabe, P.: New AES software speed records. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 322-336. Springer, Heidelberg (2008)
9. Boldyreva, A., Taesombut, N.: Online encryption schemes: new security notions and constructions. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 1-14. Springer, Heidelberg (2004)
10. Fouque, P., Joux, A., Martinet, G., Valette, F.: Authenticated on-line encryption. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 145-159. Springer, Heidelberg (2004)
11. Fouque, P., Joux, A., Poupard, G.: Blockwise adversarial model for on-line ciphers and symmetric encryption schemes. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 212-226. Springer, Heidelberg (2004) (Pubitemid 39743824)
12. Fouque, P., Martinet, G., Poupard, G.: Practical symmetricon-line encryption. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 362-375. Springer, Heidelberg (2003)
13. Gueron, S., Kounavis, M.: Intel carry-less multiplication instruction and its usage for computing the GCM mode (revision 2). White paper (May 2010), http://www.intel.com
14. 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) (Pubitemid 39748317)
15. Joux, A., Martinet, G., Valette, F.: Blockwise-adaptive attackers: revisiting the (in)securityofsomeprovablysecureencryptionmodels:CBC,GEM,IACBC. In:Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 17-30. Springer, Heidelberg (2002)
16. Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 129-139. Springer, Heidelberg (1994)
17. Liskov, M., Rivest, R., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 31-46. Springer, Heidelberg (2002)
18. Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17(2), 373-386 (1988)
19. McGrew, D., Viega, J.: The security and performance of the Galois/counter mode (GCM) of operation. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 343-355. Springer, Heidelberg (2004) (Pubitemid 39748319)
20. Meyer, C., Matyas, M.: Cryptography: A New Dimension in Data Security. John Wiley & Sons, New York (1982)
21. Nandi, M.: A simple security analysis of Hash-CBC and a new efficient one-key online cipher,Cryptology ePrint report 2007/158, May 7 (2007)
22. Nandi, M.: Two New Efficient CCA-secure online ciphers: MHCBC and MCBC. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) INDOCRYPT 2008. LNCS, vol. 5365, pp. 350-362. Springer, Heidelberg (2008); Also Cryptology ePrint report 2008/401 (September 20, 2008)
23. Naor, M., Reingold, O.: On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology 12(1), 29-66 (1999)
24. Ristenpart, T., Rogaway, P.: How to enrich the message space of a cipher. In: Biryukov, A. (ed.) FSE 2007. LNCS, vol. 4593, pp. 101-118. Springer, Heidelberg (2007)