Online ciphers from tweakable blockciphers

Phillip Rogaway; Haibin Zhang

doi:10.1007/978-3-642-19074-2_16

Online ciphers from tweakable blockciphers

Phillip Rogaway^*, Haibin Zhang

^*Corresponding author for this work

University of California at Davis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

34 Citations (Scopus)

Abstract

Online ciphers are deterministic length-preserving permutations ε_k ({0, 1}ⁿ)+ → ({0, 1}ⁿ)⁺ where the i-th block of ciphertext depends only on the first i blocks of plaintext. Definitions, constructions, and applications for these objects were first given by Bellare, Boldyreva, Knudsen, and Namprempre. We simplify and generalize their work, showing that online ciphers are rather trivially constructed from tweakable blockciphers, a notion of Liskov, Rivest, and Wagner. We go on to show how to define and achieve online ciphers for settings in which messages need not be a multiple of n bits.

Original language	English
Title of host publication	Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings
Pages	237-249
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-642-19074-2_16
Publication status	Published - 2011
Externally published	Yes
Event	11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011 - San Francisco, CA, United States Duration: 14 Feb 2011 → 18 Feb 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6558 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011
Country/Territory	United States
City	San Francisco, CA
Period	14/02/11 → 18/02/11

Keywords

Online ciphers
modes of operation
provable security
symmetric encryption
tweakable blockciphers

Access to Document

10.1007/978-3-642-19074-2_16

Cite this

Rogaway, P., & Zhang, H. (2011). Online ciphers from tweakable blockciphers. In Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings (pp. 237-249). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6558 LNCS). https://doi.org/10.1007/978-3-642-19074-2_16

@inproceedings{6289dc00ceb84e7ea7efcb081779b74d,

title = "Online ciphers from tweakable blockciphers",

abstract = "Online ciphers are deterministic length-preserving permutations εk ({0, 1}n)+ → ({0, 1}n)+ where the i-th block of ciphertext depends only on the first i blocks of plaintext. Definitions, constructions, and applications for these objects were first given by Bellare, Boldyreva, Knudsen, and Namprempre. We simplify and generalize their work, showing that online ciphers are rather trivially constructed from tweakable blockciphers, a notion of Liskov, Rivest, and Wagner. We go on to show how to define and achieve online ciphers for settings in which messages need not be a multiple of n bits.",

keywords = "Online ciphers, modes of operation, provable security, symmetric encryption, tweakable blockciphers",

author = "Phillip Rogaway and Haibin Zhang",

year = "2011",

doi = "10.1007/978-3-642-19074-2_16",

language = "English",

isbn = "9783642190735",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "237--249",

booktitle = "Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings",

note = "11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011 ; Conference date: 14-02-2011 Through 18-02-2011",

}

Rogaway, P & Zhang, H 2011, Online ciphers from tweakable blockciphers. in Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6558 LNCS, pp. 237-249, 11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011, San Francisco, CA, United States, 14/02/11. https://doi.org/10.1007/978-3-642-19074-2_16

Online ciphers from tweakable blockciphers. / Rogaway, Phillip; Zhang, Haibin.
Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings. 2011. p. 237-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6558 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Online ciphers from tweakable blockciphers

AU - Rogaway, Phillip

AU - Zhang, Haibin

PY - 2011

Y1 - 2011

N2 - Online ciphers are deterministic length-preserving permutations εk ({0, 1}n)+ → ({0, 1}n)+ where the i-th block of ciphertext depends only on the first i blocks of plaintext. Definitions, constructions, and applications for these objects were first given by Bellare, Boldyreva, Knudsen, and Namprempre. We simplify and generalize their work, showing that online ciphers are rather trivially constructed from tweakable blockciphers, a notion of Liskov, Rivest, and Wagner. We go on to show how to define and achieve online ciphers for settings in which messages need not be a multiple of n bits.

AB - Online ciphers are deterministic length-preserving permutations εk ({0, 1}n)+ → ({0, 1}n)+ where the i-th block of ciphertext depends only on the first i blocks of plaintext. Definitions, constructions, and applications for these objects were first given by Bellare, Boldyreva, Knudsen, and Namprempre. We simplify and generalize their work, showing that online ciphers are rather trivially constructed from tweakable blockciphers, a notion of Liskov, Rivest, and Wagner. We go on to show how to define and achieve online ciphers for settings in which messages need not be a multiple of n bits.

KW - Online ciphers

KW - modes of operation

KW - provable security

KW - symmetric encryption

KW - tweakable blockciphers

UR - http://www.scopus.com/inward/record.url?scp=79951784877&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-19074-2_16

DO - 10.1007/978-3-642-19074-2_16

M3 - Conference contribution

AN - SCOPUS:79951784877

SN - 9783642190735

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

SP - 237

EP - 249

BT - Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings

T2 - 11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011

Y2 - 14 February 2011 through 18 February 2011

ER -

Online ciphers from tweakable blockciphers

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this