{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T10:55:01Z","timestamp":1778151301346,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2026,3,1]]},"DOI":"10.1587\/transfun.2025cip0005","type":"journal-article","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T18:08:18Z","timestamp":1748369298000},"page":"185-193","source":"Crossref","is-referenced-by-count":1,"title":["Collision-Resistant and Pseudorandom Hashing Modes of Compression Functions"],"prefix":"10.1587","volume":"E109.A","author":[{"given":"Shoichi","family":"HIROSE","sequence":"first","affiliation":[{"name":"Faculty of Engineering, University of Fukui"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidenori","family":"KUWAKADO","sequence":"additional","affiliation":[{"name":"Faculty of Informatics, Kansai University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] P. Grubbs, J. Lu, and T. Ristenpart, \u201cMessage franking via committing authenticated encryption,\u201d Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, Aug. 2017, Proceedings, Part III, J. Katz and H. Shacham, eds., Lecture Notes in Computer Science, vol.10403, pp.66-97, Springer, 2017. 10.1007\/978-3-319-63697-9_3","DOI":"10.1007\/978-3-319-63697-9_3"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] Y. Dodis, P. Grubbs, T. Ristenpart, and J. Woodage, \u201cFast message franking: From invisible salamanders to encryptment,\u201d Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, Aug. 2018, Proceedings, Part I, H. Shacham and A. Boldyreva, eds., Lecture Notes in Computer Science, vol.10991, pp.155-186, Springer, 2018. 10.1007\/978-3-319-96884-1_6","DOI":"10.1007\/978-3-319-96884-1_6"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Boneh, S. Eskandarian, and B. Fisch, \u201cPost-quantum EPID signatures from symmetric primitives,\u201d Topics in Cryptology - CT-RSA 2019 - The Cryptographers\u2019 Track at the RSA Conference 2019, San Francisco, CA, USA, March 2019, Proceedings, M. Matsui, ed., Lecture Notes in Computer Science, vol.11405, pp.251-271, Springer, 2019. 10.1007\/978-3-030-12612-4_13","DOI":"10.1007\/978-3-030-12612-4_13"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] M. Bellare, R. Canetti, and H. Krawczyk, \u201cKeying hash functions for message authentication,\u201d Advances in Cryptology\u2006\u2014\u2006CRYPTO\u201996, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, Aug. 1996, Proceedings, N. Koblitz, ed., Lecture Notes in Computer Science, vol.1109, pp.1-15, Springer, 1996. 10.1007\/3-540-68697-5_1","DOI":"10.1007\/3-540-68697-5_1"},{"key":"5","unstructured":"[5] FIPS PUB 198-1, \u201cThe keyed-hash message authentication code (HMAC),\u201d 2008."},{"key":"6","unstructured":"[6] ISO\/IEC 9797-2:2021, \u201cInformation security\u2006\u2014\u2006Message authentication codes (MACs)\u2006\u2014\u2006Part 2: Mechanisms using a dedicated hash-function,\u201d 2021. 10.3403\/30389132"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M. Bellare, R. Canetti, and H. Krawczyk, \u201cPseudorandom functions revisited: The cascade construction and its concrete security,\u201d Proc. 37th IEEE Symposium on Foundations of Computer Science, pp.514-523, 1996. 10.1109\/sfcs.1996.548510","DOI":"10.1109\/SFCS.1996.548510"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] I. Damg\u00e5rd, \u201cA design principle for hash functions,\u201d Advances in Cryptology\u2006\u2014\u2006CRYPTO\u201989, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, Aug. 1989, Proceedings, G. Brassard, ed., Lecture Notes in Computer Science, vol.435, pp.416-427, Springer, 1989. 10.1007\/0-387-34805-0_39","DOI":"10.1007\/0-387-34805-0_39"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[9] R.C. Merkle, \u201cOne way hash functions and DES,\u201d Advances in Cryptology\u2006\u2014\u2006CRYPTO\u201989, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, Aug. 1989, Proceedings, G. Brassard, ed., Lecture Notes in Computer Science, vol.435, pp.428-446, Springer, 1989. 10.1007\/0-387-34805-0_40","DOI":"10.1007\/0-387-34805-0_40"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] M. Nandi, \u201cCharacterizing padding rules of MD hash functions preserving collision security,\u201d Information Security and Privacy, 14th Australasian Conference, ACISP 2009, Brisbane, Australia, July 2009, Proceedings, C. Boyd and J.M.G. Nieto, eds., Lecture Notes in Computer Science, vol.5594, pp.171-184, Springer, 2009. 10.1007\/978-3-642-02620-1_12","DOI":"10.1007\/978-3-642-02620-1_12"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] S. Hirose, \u201cCollision-resistant and pseudorandom function based on Merkle-Damg\u00e5rd hash function,\u201d Information Security and Cryptology - ICISC 2021 - 24th International Conference, Seoul, South Korea, Dec. 2021, Revised Selected Papers, J.H. Park and S. Seo, eds., Lecture Notes in Computer Science, vol.13218, pp.325-338, Springer, 2021. 10.1007\/978-3-031-08896-4_17","DOI":"10.1007\/978-3-031-08896-4_17"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] S. Hirose, J.H. Park, and A. Yun, \u201cA simple variant of the Merkle-Damg\u00e5rd scheme with a permutation,\u201d Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, Dec. 2007, Proceedings, K. Kurosawa, eds., Lecture Notes in Computer Science, vol.4833, pp.113-129, Springer, 2007. 10.1007\/978-3-540-76900-2_7","DOI":"10.1007\/978-3-540-76900-2_7"},{"key":"13","unstructured":"[13] FIPS PUB 180-4, \u201cSecure hash standard (SHS),\u201d March 2012. 10.6028\/NIST.FIPS.180-4"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] N. Bagheri, P. Gauravaram, L.R. Knudsen, and E. Zenner, \u201cThe suffix-free-prefix-free hash function construction and its indifferentiability security analysis,\u201d Int. J. Inf. Secur., vol.11, no.6, pp.419-434, 2012. 10.1007\/s10207-012-0175-4","DOI":"10.1007\/s10207-012-0175-4"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] M. Bellare and T. Kohno, \u201cA theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications,\u201d Advances in Cryptology\u2006\u2014\u2006EUROCRYPT 2003, International Conference on the Theory and Applications of Cryptographic Techniques, Warsaw, Poland, May 2003, Proceedings, E. Biham, ed., Lecture Notes in Computer Science, vol.2656, pp.491-506, Springer, 2003. 10.1007\/3-540-39200-9_31","DOI":"10.1007\/3-540-39200-9_31"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[16] O. Goldreich, S. Goldwasser, and S. Micali, \u201cHow to construct random functions,\u201d J. ACM, vol.33, no.4, pp.792-807, 1986. 10.1145\/6490.6503","DOI":"10.1145\/6490.6503"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[17] K. Yasuda, \u201c\u201cSandwich\u201d is indeed secure: How to authenticate a message with just one hashing,\u201d Information Security and Privacy, 12th Australasian Conference, ACISP 2007, Townsville, Australia, July 2007, Proceedings, J. Pieprzyk, H. Ghodosi, and E. Dawson, eds., Lecture Notes in Computer Science, vol.4586, pp.355-369, Springer, 2007. 10.1007\/978-3-540-73458-1_26","DOI":"10.1007\/978-3-540-73458-1_26"},{"key":"18","unstructured":"[18] K. Yasuda, \u201cHMAC without the \u201csecond\u201d key,\u201d Information Security, 12th International Conference, ISC 2009, Pisa, Italy, Sept. 2009. Proceedings, P. Samarati, M. Yung, F. Martinelli, and C.A. Ardagna, eds., Lecture Notes in Computer Science, vol.5735, pp.443-458, Springer, 2009. 10.1007\/978-3-642-04474-8_35"},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] M. Bellare, D.J. Bernstein, and S. Tessaro, \u201cHash-function based PRFs: AMAC and its multi-user security,\u201d Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 2016, Proceedings, Part I, M. Fischlin and J. Coron, eds., Lecture Notes in Computer Science, vol.9665, pp.566-595, Springer, 2016. 10.1007\/978-3-662-49890-3_22","DOI":"10.1007\/978-3-662-49890-3_22"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[20] M. Bellare and T. Ristenpart, \u201cMulti-property-preserving hash domain extension and the EMD transform,\u201d Advances in Cryptology - ASIACRYPT 2006, 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, Dec. 2006, Proceedings, X. Lai and K. Chen, eds., Lecture Notes in Computer Science, vol.4284, pp.299-314, Springer, 2006. 10.1007\/11935230_20","DOI":"10.1007\/11935230_20"},{"key":"21","unstructured":"[21] NIST Special Publication 800-38B, \u201cRecommendation for block cipher modes of operation: The CMAC mode for authentication,\u201d 2005. 10.6028\/NIST.SP.800-38B"},{"key":"22","unstructured":"[22] T. Iwata and K. Kurosawa, \u201cOMAC: One-key CBC MAC,\u201d Cryptology ePrint Archive, Report 2002\/180, 2002. https:\/\/ia.cr\/2002\/180"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] T. Iwata and K. Kurosawa, \u201cOMAC: One-key CBC MAC,\u201d Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, Feb. 2003, Revised Papers, T. Johansson, ed., Lecture Notes in Computer Science, vol.2887, pp.129-153, Springer, 2003. 10.1007\/978-3-540-39887-5_11","DOI":"10.1007\/978-3-540-39887-5_11"},{"key":"24","doi-asserted-by":"crossref","unstructured":"[24] H. Kuwakado and S. Hirose, \u201cPseudorandom-function property of the step-reduced compression functions of SHA-256 and SHA-512,\u201d Information Security Applications, 9th International Workshop, WISA 2008, Jeju Island, Korea, Sept. 2008, Revised Selected Papers, K. Chung, K. Sohn, and M. Yung, eds., Lecture Notes in Computer Science, vol.5379, pp.174-189, Springer, 2008. 10.1007\/978-3-642-00306-6_13","DOI":"10.1007\/978-3-642-00306-6_13"},{"key":"25","unstructured":"[25] S. Hirose and A. Yabumoto, \u201cA tweak for a PRF mode of a compression function and its applications,\u201d Innovative Security Solutions for Information Technology and Communications - 9th International Conference, SECITC 2016, Bucharest, Romania, June 2016, Revised Selected Papers, I. Bica and R. Reyhanitabar, eds., Lecture Notes in Computer Science, vol.10006, pp.103-114, 2016. 10.1007\/978-3-319-47238-6_7"},{"key":"26","unstructured":"[26] H. Kuwakado, \u201cCollision-resistant and pseudorandom hashing modes,\u201d https:\/\/github.com\/kuwakado\/CRPRF, 2025 (accessed March 4, 2025)."}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025CIP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T04:10:58Z","timestamp":1772856658000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E109.A\/3\/E109.A_2025CIP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,1]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2025cip0005","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,1]]},"article-number":"2025CIP0005"}}