{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:43:46Z","timestamp":1760197426109,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2018,6,10]],"date-time":"2018-06-10T00:00:00Z","timestamp":1528588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP16H02828"],"award-info":[{"award-number":["JP16H02828"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property. The collision resistance of a hash function using the proposed domain extension is shown to be reduced to the collision resistance and the everywhere preimage resistance of the underlying compression function in the standard model, where the compression function is assumed to be chosen at random from a function family in some efficient way. Its indifferentiability from a random oracle up to the birthday bound is also shown on the assumption that the underlying compression function is a fixed-input-length random oracle or the Davies-Meyer mode of a block cipher chosen uniformly at random. The proposed domain extension is also applied to the sponge construction and the resultant hash function is shown to be indifferentiable from a random oracle up to the birthday bound in the ideal permutation model. The proposed domain extension scheme is expected to be useful for processing short messages.<\/jats:p>","DOI":"10.3390\/cryptography2020011","type":"journal-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T11:01:01Z","timestamp":1528714861000},"page":"11","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Sequential Hashing with Minimum Padding"],"prefix":"10.3390","volume":"2","author":[{"given":"Shoichi","family":"Hirose","sequence":"first","affiliation":[{"name":"Faculty of Engineering, University of Fukui, Fukui 910-8507, Japan"}]}],"member":"1968","published-online":{"date-parts":[[2018,6,10]]},"reference":[{"key":"ref_1","unstructured":"Dang, Q.H. (2012). Secure Hash Standard (SHS)."},{"key":"ref_2","first-page":"428","article-title":"One Way Hash Functions and DES","volume":"Volume 435","author":"Brassard","year":"1990","journal-title":"Advances in Cryptology\u2014CRYPTO 89, Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, CA, USA, 20\u201324 August 1989"},{"key":"ref_3","first-page":"416","article-title":"A Design Principle for Hash Functions","volume":"Volume 435","author":"Brassard","year":"1990","journal-title":"Advances in Cryptology\u2014CRYPTO 89, Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, CA, USA, 20\u201324 August 1989"},{"key":"ref_4","first-page":"1","article-title":"Keying Hash Functions for Message Authentication","volume":"Volume 1109","author":"Koblitz","year":"1996","journal-title":"Advances in Cryptology\u2014CRYPTO 96, Proceedings of the 16th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 1996"},{"key":"ref_5","first-page":"113","article-title":"A Simple Variant of the Merkle-Damg\u00e5rd Scheme with a Permutation","volume":"Volume 4833","author":"Kurosawa","year":"2007","journal-title":"Advances in Cryptology\u2014ASIACRYPT 2007, Proceedings of the 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, 2\u20136 December 2007"},{"key":"ref_6","first-page":"103","article-title":"A Tweak for a PRF Mode of a Compression Function and Its Applications","volume":"Volume 10006","author":"Bica","year":"2016","journal-title":"Innovative Security Solutions for Information Technology and Communications, Proceedings of the 9th International Conference, SECITC 2016, Bucharest, Romania, 9\u201310 June 2016"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10207-012-0175-4","article-title":"The suffix-free-prefix-free hash function construction and its indifferentiability security analysis","volume":"11","author":"Bagheri","year":"2012","journal-title":"Int. J. Inf. Secur."},{"key":"ref_8","first-page":"171","article-title":"Characterizing Padding Rules of MD Hash Functions Preserving Collision Security","volume":"Volume 5594","author":"Boyd","year":"2009","journal-title":"Information Security and Privacy, Proceedings of the 14th Australasian Conference, ACISP 2009, Brisbane, Australia, 1\u20133 July 2009"},{"key":"ref_9","first-page":"430","article-title":"Merkle-Damg\u00e5rd Revisited: How to Construct a Hash Function","volume":"Volume 3621","author":"Shoup","year":"2005","journal-title":"Advances in Cryptology\u2014CRYPTO 2005, Proceedings of the 25th Annual International Cryptology Conference, Santa Barbara, CA, USA, 14-18 August 2005"},{"key":"ref_10","first-page":"21","article-title":"Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology","volume":"Volume 2951","author":"Naor","year":"2004","journal-title":"Theory of Cryptography, Proceedings of the First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA, 19-21 February 2004"},{"key":"ref_11","first-page":"283","article-title":"Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding","volume":"Volume 4284","author":"Lai","year":"2006","journal-title":"Advances in Cryptology\u2014ASIACRYPT 2006, Proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, 3\u20137 December 2006"},{"key":"ref_12","first-page":"429","article-title":"Improved Indifferentiability Security Analysis of chopMD Hash Function","volume":"Volume 5086","author":"Nyberg","year":"2008","journal-title":"Fast Software Encryption, Proceedings of the 15th International Workshop, FSE 2008, Lausanne, Switzerland, 10\u201313 February 2008"},{"key":"ref_13","first-page":"299","article-title":"Multi-property-preserving hash domain extension and the EMD transform","volume":"Volume 4284","author":"Lai","year":"2006","journal-title":"Advances in Cryptology\u2014ASIACRYPT 2006, Proceedings of the 12th International Conference on the Theory and Application of Cryptology and Information Security, Shanghai, China, 3\u20137 December 2006"},{"key":"ref_14","unstructured":"Kelsey, J. (2018, June 09). Public Comments on the Draft Federal Information Processing Standard (FIPS) Draft FIPS 180-2, Secure Hash Standard (SHS), 2001. Available online: http:\/\/www.cs.utsa.edu\/\u223cwagner\/CS4363\/SHS\/dfips-180-2-comments1.pdf."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Dworkin, M.J. (2005). Recommendation for Block Cipher Modes of Operation: The CMAC Mode for Authentication.","DOI":"10.6028\/NIST.SP.800-38b-2005"},{"key":"ref_16","first-page":"384","article-title":"A Block-Cipher Mode of Operation for Parallelizable Message Authentication","volume":"Volume 2332","author":"Knudsen","year":"2002","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2002, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, 28 April\u20132 May 2002"},{"key":"ref_17","first-page":"375","article-title":"Fast and Secure CBC-Type MAC Algorithms","volume":"Volume 5665","author":"Dunkelman","year":"2009","journal-title":"Fast Software Encryption, Proceedings of the 16th International Workshop, FSE 2009, Leuven, Belgium, 22\u201325 February 2009"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.dam.2008.03.038","article-title":"Domain extender for collision resistant hash functions: Improving upon Merkle-Damg\u00e5rd iteration","volume":"157","author":"Sarkar","year":"2009","journal-title":"Discret. Appl. Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10207-013-0220-y","article-title":"Sufficient conditions for sound tree and sequential hashing modes","volume":"13","author":"Bertoni","year":"2014","journal-title":"Int. J. Inf. Secur."},{"key":"ref_20","first-page":"217","article-title":"Sakura: A Flexible Coding for Tree Hashing","volume":"Volume 8479","author":"Boureanu","year":"2014","journal-title":"Applied Cryptography and Network Security, Proceedings of the 12th International Conference, ACNS 2014, Lausanne, Switzerland, 10\u201313 June 2014"},{"key":"ref_21","unstructured":"Bertoni, G., Daemen, J., Peeters, M., and Van Assche, G. (2007, January 24\u201325). Sponge Functions. Proceedings of the ECRYPT Hash Workshop 2007, Barcelona, Spain."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Dworkin, M.J. (2015). SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions.","DOI":"10.6028\/NIST.FIPS.202"},{"key":"ref_23","first-page":"222","article-title":"The PHOTON Family of Lightweight Hash Functions","volume":"Volume 6841","author":"Rogaway","year":"2011","journal-title":"Advances in Cryptology\u2014CRYPTO 2011, Proceedings of the 31st Annual Cryptology Conference, Santa Barbara, CA, USA, 14\u201318 August 2011"},{"key":"ref_24","first-page":"312","article-title":"spongent: A Lightweight Hash Function","volume":"Volume 6917","author":"Preneel","year":"2011","journal-title":"Cryptographic Hardware and Embedded Systems\u2014CHES 2011, Proceedings of the 13th International Workshop, Nara, Japan, 28 September\u20131 October 2011"},{"key":"ref_25","first-page":"320","article-title":"Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications","volume":"Volume 7118","author":"Miri","year":"2011","journal-title":"Selected Areas in Cryptography, Proceedings of the 18th International Workshop, SAC 2011, Toronto, ON, Canada, 11\u201312 August 2011"},{"key":"ref_26","first-page":"371","article-title":"Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance","volume":"Volume 3017","author":"Roy","year":"2004","journal-title":"Fast Software Encryption, Proceedings of the 11th International Workshop, FSE 2004, Delhi, India, 5\u20137 February 2004"},{"key":"ref_27","first-page":"409","article-title":"The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs","volume":"Volume 4004","author":"Vaudenay","year":"2006","journal-title":"Advances in Cryptology\u2014EUROCRYPT 2006, Proceedings of the 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, 28 May\u20131 June 2006"},{"key":"ref_28","first-page":"102","article-title":"2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms","volume":"Volume 434","author":"Quisquater","year":"1989","journal-title":"Advances in Cryptology\u2014EUROCRYPT \u201989, Proceedings of the Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, 10\u201313 April 1989"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/2\/11\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:08:04Z","timestamp":1760195284000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/2\/2\/11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,10]]},"references-count":28,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2018,6]]}},"alternative-id":["cryptography2020011"],"URL":"https:\/\/doi.org\/10.3390\/cryptography2020011","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2018,6,10]]}}}