{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:03:55Z","timestamp":1769720635860,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T00:00:00Z","timestamp":1385164800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10207-013-0220-y","type":"journal-article","created":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T09:09:02Z","timestamp":1385111342000},"page":"335-353","source":"Crossref","is-referenced-by-count":12,"title":["Sufficient conditions for sound tree and sequential hashing modes"],"prefix":"10.1007","volume":"13","author":[{"given":"Guido","family":"Bertoni","sequence":"first","affiliation":[]},{"given":"Joan","family":"Daemen","sequence":"additional","affiliation":[]},{"given":"Micha\u00ebl","family":"Peeters","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Van Assche","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,23]]},"reference":[{"key":"220_CR1","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Mennink, B., Preneel, B.: Security reductions of the second round SHA-3 candidates. Cryptology ePrint Archive, Report 2010\/381, 2010, http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-18178-8_5"},{"issue":"6","key":"220_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10207-012-0175-4","volume":"11","author":"N Bagheri","year":"2012","unstructured":"Bagheri, N., Gauravaram, P., Knudsen, L.R., Zenner, E.: The suffix-free-prefix-free hash function construction and its indifferentiability security analysis. Int. J. Inf. Secur. 11(6), 419\u2013434 (2012)","journal-title":"Int. J. Inf. Secur."},{"key":"220_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) Advances in Cryptology\u2014Crypto \u201996, LNCS, no. 1109, pp. 1\u201315. Springer (1996)","DOI":"10.1007\/3-540-68697-5_1"},{"key":"220_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Ristenpart, T.: Multi-property-preserving hash domain extension and the EMD transform. In: Lai, X. and Chen, K. (eds.) Advances in Cryptology\u2014Asiacrypt 2006, LNCS, no. 4284, pp. 299\u2013314. Springer (2006)","DOI":"10.1007\/11935230_20"},{"key":"220_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM (ed.) ACM Conference on Computer and Communications Security 1993, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"220_CR6","doi-asserted-by":"crossref","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G., Van Keer, R.: Keccak implementation overview, May 2012, http:\/\/keccak.noekeon.org\/","DOI":"10.1007\/978-3-642-38348-9_19"},{"key":"220_CR7","doi-asserted-by":"crossref","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N.P. (eds.) Advances in Cryptology\u2014Eurocrypt 2008. Lecture Notes in Computer Science, vol. 4965, pp. 181\u2013197. Springer (2008) http:\/\/sponge.noekeon.org\/","DOI":"10.1007\/978-3-540-78967-3_11"},{"key":"220_CR8","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sakura: A flexible coding for tree hashing. Cryptology ePrint Archive, Report 2013\/231, 2013, http:\/\/eprint.iacr.org\/"},{"key":"220_CR9","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sponge functions. Ecrypt Hash Workshop 2007, May 2007, also available as public comment to NIST from http:\/\/www.csrc.nist.gov\/pki\/HashWorkshop\/Public_Comments\/2007_May.html"},{"key":"220_CR10","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sufficient conditions for sound tree hashing modes. In: Handschuh, H., Lucks, S., Preneel, B., Rogaway, P. (eds.) Symmetric Cryptography (Dagstuhl, Germany), Dagstuhl Seminar Proceedings, no. 09031, Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"220_CR11","unstructured":"Bitcoin Portal, Bitcoin protocol specification. 2013, https:\/\/en.bitcoin.it\/wiki\/Protocol_specification"},{"key":"220_CR12","doi-asserted-by":"crossref","unstructured":"Chang, D., Nandi, M.: Improved indifferentiability security analysis of chopMD hash function, In: Nyberg, K. (ed.) Fast Software Encryption. Lecture Notes in Computer Science, vol. 5086, Springer, pp. 429\u2013443 (2008)","DOI":"10.1007\/978-3-540-71039-4_27"},{"key":"220_CR13","unstructured":"Chapweske, J., Mohr, G.: Tree Hash EXchange format (THEX). 2003, http:\/\/adc.sourceforge.net\/draft-jchapweske-thex-02.html"},{"key":"220_CR14","doi-asserted-by":"crossref","unstructured":"Coron, J., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damg\u00e5rd revisited: How to construct a hash function. In: Shoup, V. (ed.) Advances in Cryptology\u2014Crypto 2005, LNCS, no. 3621, pp. 430\u2013448. Springer (2005)","DOI":"10.1007\/11535218_26"},{"key":"220_CR15","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I.: A design principle for hash functions. In: Brassard, G. (ed.) Advances in Cryptology\u2014Crypto \u201989, LNCS, no. 435, pp. 416\u2013427. Springer (1989)","DOI":"10.1007\/0-387-34805-0_39"},{"key":"220_CR16","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Reyzin, L., Rivest, R., Shen, E.: Indifferentiability of permutation-based compression functions and tree-based modes of operation, with applications to MD6. In: O. Dunkelman, (ed.) Fast Software Encryption. Lecture Notes in Computer Science, vol. 5665, pp. 104\u2013121. Springer (2009)","DOI":"10.1007\/978-3-642-03317-9_7"},{"key":"220_CR17","doi-asserted-by":"crossref","unstructured":"Hirose, S., Park, J., Yun, A.: A simple variant of the Merkle-Damg\u00e5rd scheme with a permutation. Asiacrypt, pp. 113\u2013129 (2007)","DOI":"10.1007\/978-3-540-76900-2_7"},{"key":"220_CR18","doi-asserted-by":"crossref","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) Theory of Cryptography\u2014TCC 2004. Lecture Notes in Computer Science, no. 2951, pp. 21\u201339. Springer (2004)","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"220_CR19","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems, PhD thesis. UMI Research Press (1982)"},{"key":"220_CR20","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008) http:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"220_CR21","unstructured":"NIST, Federal information processing standard 180\u20132, secure hash standard. August 2002"},{"key":"220_CR22","doi-asserted-by":"crossref","unstructured":"Ristenpart, T., Shacham, H., Shrimpton, T.: Careful with composition: Limitations of the indifferentiability framework. In: Paterson, K.G. (ed.) Eurocrypt 2011. Lecture Notes in Computer Science, vol. 6632, pp. 487\u2013506. Springer (2011)","DOI":"10.1007\/978-3-642-20465-4_27"},{"key":"220_CR23","unstructured":"Rivest, R., Agre, B., Bailey, D.V., Cheng, S., Crutchfield, C., Dodis, Y., Fleming, K.E., Khan, A., Krishnamurthy, J., Lin, Y., Reyzin, L., Shen, E., Sukha, J., Sutherland, D., Tromer, E., Yin, Y.L.: The MD6 hash function\u2014a proposal to NIST for SHA-3. Submission to NIST, (2008) http:\/\/groups.csail.mit.edu\/cis\/md6\/"},{"key":"220_CR24","unstructured":"Sarkar, P., Schellenberg, P.J.: A parallelizable design principle for cryptographic hash functions. Cryptology ePrint Archive, Report 2002\/031, 2002, http:\/\/eprint.iacr.org\/"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-013-0220-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-013-0220-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-013-0220-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T23:40:48Z","timestamp":1564875648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-013-0220-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,23]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["220"],"URL":"https:\/\/doi.org\/10.1007\/s10207-013-0220-y","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,23]]}}}