Online ciphers and the Hash-CBC construction

49Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2001.

Cite

CITATION STYLE

APA

Bellare, M., Boldyreva, A., Knudsen, L., & Namprempre, C. (2001). Online ciphers and the Hash-CBC construction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2139 LNCS, pp. 292–309). Springer Verlag. https://doi.org/10.1007/3-540-44647-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free