Abstract
We initiate a study of on-line ciphers. These are ciphers that can take input plaintexts of large and varying lengths and will output the ith block of the ciphertext after having processed only the first i blocks of the plaintext. Such ciphers permit length-preserving encryption of a data stream with only a single pass through the data. We provide security definitions for this primitive and study its basic properties. We then provide attacks on some possible candidates, including CBC with fixed IV. Finally we provide a construction called HCBC which is based on a given block cipher E and a family of AXU functions. HCBC is proven secure against chosen-plaintext attacks assuming that E is a PRP secure against chosen-plaintext attacks
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bellare, A. Boldyreva, L. Knudsen, C. Namprempre. On-line ciphers and the Hash-CBC construction. Full version of this paper, available via http://www-cse.ucsd.edu/users/mihir.
M. Bellare, J. Kilian, and P. Rogaway. The security of the cipher block chaining message authentication code. In Journal of Computer and System Sciences, volume 61, No. 3, pages 362–399, Dec 2000. Academic Press.
M. Bellare and C. Namprempre. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In T. Okamoto, editor, Advances in Cryptology— ASIACRYPT’ 00, volume 1976 of Lecture Notes in Computer Science, pages 531–545, Berlin, Germany, Dec. 2000. Springer-Verlag.
M. Bellare and P. Rogaway. Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography. In T. Okamoto, editor, Advances in Cryptology — ASIACRYPT’ 00, volume 1976 of Lecture Notes in Computer Science, pages 317–330, Berlin, Germany, Dec. 2000. Springer-Verlag.
C. Campbell. Design and specification of cryptographic capabilities. In D. Brandstad, editor, Computer Security and the Data Encryption Standard, National Bureau of Standards Special Publications 500-27, U.S. Department of Commerce, pages 54–66, February 1978.
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions, Journal of the ACM, Vol. 33, No. 4, 1986, pp. 210–217.
L. Knudsen. Block chaining modes of operation. Reports in Informatics, Report 207, Dept. of Informatics, University of Bergen, October 2000.
H. Krawczyk. LFSR-based hashing and authenticating. In Y. Desmedt, editor, Advances in Cryptology — CRYPTO’ 94, volume 839 of Lecture Notes in Computer Science, pages 129–139, Berlin, Germany, 1994. Springer-Verlag.
M. Luby and C. Rackoff. How to construct pseudo-random permutations from pseudo-random functions. SIAM Journal of Computing, Vol. 17, No. 2, pp. 373–386, April 1988.
C. Meyer and Matyas. A new direction in Computer Data Security. John Wiley & Sons, 1982.
M. Naor and O. Reingold. On the construction of pseudorandom permutations: Luby-Rackoff Revisited. In J. Feigenbaum, editor, Journal of Cryptology, Volume 12, Number 1, Winter 1999. Springer-Verlag.
W. Nevelsteen and B. Preneel. Software performance of universal hash functions. In J. Stern, editor, Advances in Cryptology — EUROCRYPT’ 99, volume 1592 of Lecture Notes in Computer Science, pages 24–41, Berlin, Germany, 1999. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellare, M., Boldyreva, A., Knudsen, L., Namprempre, C. (2001). Online Ciphers and the Hash-CBC Construction. In: Kilian, J. (eds) Advances in Cryptology — CRYPTO 2001. CRYPTO 2001. Lecture Notes in Computer Science, vol 2139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44647-8_18
Download citation
DOI: https://doi.org/10.1007/3-540-44647-8_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42456-7
Online ISBN: 978-3-540-44647-7
eBook Packages: Springer Book Archive