Tweakable enciphering schemes from hash-sum-expansion

Kazuhiko Minematsu*, Toshiyasu Matsushima

*この研究の対応する著者

研究成果: Conference contribution

15 被引用数 (Scopus)

抄録

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 doubleblock-length cryptographic permutation using WPRF.

本文言語English
ホスト出版物のタイトルProgress in Cryptology - INDOCRYPT 2007 - 8th International Conference on Cryptology in India, Proceedings
ページ252-267
ページ数16
出版ステータスPublished - 2007 12 1
イベント8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007 - Chennai, India
継続期間: 2007 12 92007 12 13

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4859 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007
国/地域India
CityChennai
Period07/12/907/12/13

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Tweakable enciphering schemes from hash-sum-expansion」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル