Tweakable enciphering schemes from hash-sum-expansion

Kazuhiko Minematsu, Toshiyasu Matsushima

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Pages252-267
    Number of pages16
    Volume4859 LNCS
    Publication statusPublished - 2007
    Event8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007 - Chennai
    Duration: 2007 Dec 92007 Dec 13

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume4859 LNCS
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    Other8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007
    CityChennai
    Period07/12/907/12/13

    Fingerprint

    Pseudorandom Function
    Security Proof
    Universal Function
    Hash Function
    Hash functions
    Permutation
    Attack
    Output

    Keywords

    • HCH
    • HCTR
    • Mode of operation
    • Weak pseudorandom function

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    Minematsu, K., & Matsushima, T. (2007). Tweakable enciphering schemes from hash-sum-expansion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4859 LNCS, pp. 252-267). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4859 LNCS).

    Tweakable enciphering schemes from hash-sum-expansion. / Minematsu, Kazuhiko; Matsushima, Toshiyasu.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4859 LNCS 2007. p. 252-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4859 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Minematsu, K & Matsushima, T 2007, Tweakable enciphering schemes from hash-sum-expansion. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4859 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4859 LNCS, pp. 252-267, 8th Annual International Conference on Cryptolology in India, INDOCRYPT 2007, Chennai, 07/12/9.
    Minematsu K, Matsushima T. Tweakable enciphering schemes from hash-sum-expansion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4859 LNCS. 2007. p. 252-267. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Minematsu, Kazuhiko ; Matsushima, Toshiyasu. / Tweakable enciphering schemes from hash-sum-expansion. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4859 LNCS 2007. pp. 252-267 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{c025204774354555a28bd9237d5b63d8,
    title = "Tweakable enciphering schemes from hash-sum-expansion",
    abstract = "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.",
    keywords = "HCH, HCTR, Mode of operation, Weak pseudorandom function",
    author = "Kazuhiko Minematsu and Toshiyasu Matsushima",
    year = "2007",
    language = "English",
    isbn = "9783540770251",
    volume = "4859 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    pages = "252--267",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - Tweakable enciphering schemes from hash-sum-expansion

    AU - Minematsu, Kazuhiko

    AU - Matsushima, Toshiyasu

    PY - 2007

    Y1 - 2007

    N2 - 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.

    AB - 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.

    KW - HCH

    KW - HCTR

    KW - Mode of operation

    KW - Weak pseudorandom function

    UR - http://www.scopus.com/inward/record.url?scp=38349022443&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=38349022443&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 9783540770251

    VL - 4859 LNCS

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 252

    EP - 267

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    ER -