- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | Tweakable Enciphering Schemes from Hash - Sum - Expansion (in Japanese) |
|---|---|
| Authors | Kazuhiko Minematsu 、Toshiyasu Matsushima |
| Released Year | 2007 |
| Format | International Conference |
| Category | Information security |
| Jounal Name | 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 |
| Jounal Page | pp. 252-267, Chennai, India |
| Published Year | 2007 |
| Published Month | 12 |
| Abstract （English） |
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. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
