{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:50:27Z","timestamp":1743076227378,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075358"},{"type":"electronic","value":"9783319075365"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07536-5_14","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T23:14:16Z","timestamp":1401923656000},"page":"217-234","source":"Crossref","is-referenced-by-count":8,"title":["Sakura: A Flexible Coding for Tree Hashing"],"prefix":"10.1007","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","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security 1993, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G. Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 181\u2013197. Springer, Heidelberg (2008), http:\/\/sponge.noekeon.org\/"},{"key":"14_CR3","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sufficient conditions for sound tree hashing modes, Symmetric Cryptography. In: Handschuh, H., Lucks, S., Preneel, B., Rogaway, P. (eds.) Dagstuhl Seminar Proceedings, no. 09031, Dagstuhl, Germany. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"14_CR4","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: The Keccak reference (January 2011), http:\/\/keccak.noekeon.org\/"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Keccak and the SHA3 standardization, presentation at NIST (February 2013), http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/documents\/Keccak-slides-at-NIST.pdf","DOI":"10.1007\/978-3-642-38348-9_19"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Van Assche, G.: Sufficient conditions for sound tree and sequential hashing modes. International Journal of Information Security (2013), http:\/\/dx.doi.org\/10.1007\/s10207-013-0220-y","DOI":"10.1007\/s10207-013-0220-y"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J.-S. Coron","year":"2005","unstructured":"Coron, J.-S., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-damg\u00e5rd revisited: How to construct a hash function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Reyzin, L., Rivest, R.L., Shen, E.: Indifferentiability of permutation-based compression functions and tree-based modes of operation, with applications to MD6. In: Dunkelman, O. (ed.) FSE 2009. LNCS, vol.\u00a05665, pp. 104\u2013121. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03317-9_7"},{"key":"14_CR10","unstructured":"Ferguson, N., Lucks, S., Schneier, B., Whiting, D., Bellare, M., Kohno, T., Callas, J., Walker, J.: The Skein hash function family, Submission to NIST (2008), http:\/\/skein-hash.info\/"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.4236\/jis.2013.41002","volume":"4","author":"S. Gueron","year":"2013","unstructured":"Gueron, S.: A j-lanes tree hashing mode and j-lanes SHA-256. Journal of Information Security\u00a04, 4\u201311 (2013)","journal-title":"Journal of Information Security"},{"key":"14_CR12","unstructured":"Kelsey, J.: Moving forward with SHA3, NIST hash forum (November 2013), http:\/\/csrc.nist.gov\/groups\/ST\/hash\/sha-3\/documents\/kelsey-email-moving-forward-110113.pdf"},{"key":"14_CR13","unstructured":"RSA Laboratories, PKCS # 1 v2.2 RSA Cryptography Standard (2012)"},{"key":"14_CR14","unstructured":"Lucks, S.: Tree hashing: A simple generic tree hashing mode designed for SHA-2 and SHA-3, applicable to other hash functions, Early Symmetric Crypto (ESC) (2013)"},{"key":"14_CR15","unstructured":"Lucks, S., McGrew, D., Whiting, D.: Batteries included: Features and modes for next generation hash functions. In: The Third SHA-3 Candidate Conference (2012)"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U. Maurer","year":"2004","unstructured":"Maurer, U., Renner, R., Holenstein, C.: Indifferentiability, impossibility results on reductions, and applications to the random oracle methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"key":"14_CR17","unstructured":"Merkle, R.C.: Secrecy, authentication, and public key systems, PhD thesis. UMI Research Press (1982)"},{"key":"14_CR18","unstructured":"NIST, Mailing list on NIST\u2019s cryptographic hash workshops and hash algorithm competition, http:\/\/csrc.nist.gov\/groups\/ST\/hash\/email_list.html"},{"key":"14_CR19","unstructured":"Merkle, R.C.: NIST special publication 800-57, recommendation for key management (March 2007) (revised)"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Overell, P.: Augmented BNF for syntax specifications: ABNF, Internet Request for Comments, RFC 5234 (January 2008)","DOI":"10.17487\/rfc5234"},{"key":"14_CR21","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 \u2013 a proposal to NIST for SHA-3, Submission to NIST (2008), http:\/\/groups.csail.mit.edu\/cis\/md6\/"},{"key":"14_CR22","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\/"},{"key":"14_CR23","unstructured":"Torgerson, M., Schroeppel, R., Draelos, T., Dautenhahn, N., Malone, S., Walker, A., Collins, M., Orman, H.: The SANDstorm hash, Submission to NIST (2008), http:\/\/www.sandia.gov\/scada\/documents\/SANDstorm_Submission_2008_10_30.pdf"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07536-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:29:18Z","timestamp":1649204958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07536-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075358","9783319075365"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07536-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}