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

^*此作品的通讯作者

University of California at Davis

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

34 引用（Scopus）

摘要

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.

源语言	英语
主期刊名	Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings
页	237-249
页数	13
DOI	https://doi.org/10.1007/978-3-642-19074-2_16
出版状态	已出版 - 2011
已对外发布	是
活动	11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011 - San Francisco, CA, 美国期限: 14 2月 2011 → 18 2月 2011

出版系列

姓名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
卷	6558 LNCS
ISSN（印刷版）	0302-9743
ISSN（电子版）	1611-3349

会议

会议	11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011
国家/地区	美国
市	San Francisco, CA
时期	14/02/11 → 18/02/11

访问文件

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

其它文件与链接

链接到 Scopus 的出版物

引用此

Rogaway, P., & Zhang, H. (2011). Online ciphers from tweakable blockciphers. 在 Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings (页码 237-249). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 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. 在 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), 卷 6558 LNCS, 页码 237-249, 11th Cryptographers' Track at the RSA Conference 2011: Topics in Cryptology, CT-RSA 2011, San Francisco, CA, 美国, 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. 页码 237-249 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 6558 LNCS).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

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

摘要

出版系列

会议

访问文件

其它文件与链接

指纹

引用此