摘要
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.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | Topics in Cryptology - CT-RSA 2011 - The Cryptographers' Track at the RSA Conference 2011, Proceedings |
| 页 | 237-249 |
| 页数 | 13 |
| DOI | |
| 出版状态 | 已出版 - 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 |
指纹
探究 'Online ciphers from tweakable blockciphers' 的科研主题。它们共同构成独一无二的指纹。引用此
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