| タイトル | Tweakable Enciphering Schemes from Hash - Sum - Expansion |
|---|---|
| 著者 | 峯松 一彦 、松嶋 敏泰 |
| 年度 | 2007 |
| 形式 | 国際学会 |
| 分野 | 情報セキュリティ |
| 掲載雑誌名 | Progress in Cryptology - INDOCRYPT 2007, 8th International Conference on Cryptology in India, Chennai, India, December 9-13, 2007, Proceedings. Lecture Notes in Computer Science 4859 Springer 2007 |
| 掲載号・ページ | pp. 252-267, Chennai, India |
| 掲載年 | 2007 |
| 掲載月 | 12 |
| アブスト （日本語） |
学会名：8th International Conference on Cryptology 日程：2007年12月9日～12月13日 場所：Chennai, India 査読有り DOI: https://doi.org/10.1007/978-3-540-77026-8_19 |
| アブスト （英語） |
We study a tweakable blockcipher for arbitrarily long message (also called a tweakable enciphering scheme) that consists of a universal hash function and an expansion, a keyed function with short input and long output. Such schemes, called HCTR and HCH, have been recently proposed. They used (a variant of) the counter mode of a blockcipher for the expansion. We provide a security proof of a structure that underlies HCTR and HCH. We prove that the expansion can be instantiated with any function secure against Known-plaintext attacks (KPAs), which is called a weak pseudorandom function (WPRF). As an application of our proof, we provide efficient blockcipher-based schemes comparable to HCH and HCTR. For the double-block-length case, our result is an interesting extension of previous attempts to build a double-block-length cryptographic permutation using WPRF. |
| 備考 （日本語） |
1 |
| 備考 （英語） |
1 |
| 論文原稿 | |
| 発表資料 |
