{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:27:53Z","timestamp":1772044073962,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540884026","type":"print"},{"value":"9783540884033","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88403-3_5","type":"book-chapter","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T04:26:31Z","timestamp":1223353591000},"page":"63-78","source":"Crossref","is-referenced-by-count":61,"title":["Merkle Tree Traversal Revisited"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Buchmann","sequence":"first","affiliation":[]},{"given":"Erik","family":"Dahmen","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2006.11.029","volume":"372","author":"P. Berman","year":"2007","unstructured":"Berman, P., Karpinski, M., Nekrich, Y.: Optimal trade-off for Merkle tree traversal. Theoretical Computer Science\u00a0372(1), 26\u201336 (2007)","journal-title":"Theoretical Computer Science"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/11941378_25","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"J. Buchmann","year":"2006","unstructured":"Buchmann, J., Coronado, C., Dahmen, E., D\u00f6ring, M., Klintsevich, E.: CMSS \u2014 an improved Merkle signature scheme. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 349\u2013363. Springer, Heidelberg (2006)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-72738-5_3","volume-title":"Applied Cryptography and Network Security","author":"J. Buchmann","year":"2007","unstructured":"Buchmann, J., Dahmen, E., Klintsevich, E., Okeya, K., Vuillaume, C.: Merkle signatures with virtually unlimited signature capacity. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 31\u201345. Springer, Heidelberg (2007)"},{"key":"5_CR4","unstructured":"Coronado, C.: On the security and the efficiency of the Merkle signature scheme. Cryptology ePrint Archive, Report 2005\/192 (2005), http:\/\/eprint.iacr.org\/"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11586821_8","volume-title":"Cryptography and Coding","author":"C. Dods","year":"2005","unstructured":"Dods, C., Smart, N., Stam, M.: Hash based digital signature schemes. In: Smart, N. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 96\u2013115. Springer, Heidelberg (2005)"},{"key":"5_CR6","first-page":"212","volume-title":"Proceedings of the Twenty-Eighth Annual Symposium on the Theory of Computing","author":"L.K. Grover","year":"1996","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual Symposium on the Theory of Computing, pp. 212\u2013219. ACM Press, New York (1996)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-36563-X_21","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"M. Jakobsson","year":"2003","unstructured":"Jakobsson, M., Leighton, T., Micali, S., Szydlo, M.: Fractal Merkle tree representation and traversal. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 314\u2013326. Springer, Heidelberg (2003)"},{"key":"5_CR8","unstructured":"Lamport, L.: Constructing digital signatures from a one way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory (1979)"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra, A.K., Verheul., E.R.: Selecting cryptographic key sizes. Journal of Cryptology\u00a014(4), 255\u2013293 (2001); updated version (2004), http:\/\/plan9.bell-labs.com\/who\/akl\/index.html","journal-title":"Journal of Cryptology"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 218\u2013238. Springer, Heidelberg (1990)"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Naor, D., Shenhav, A., Wool, A.: One-time signatures revisited: Practical fast signatures using fractal merkle tree traversal. In: IEEE \u2013 24th Convention of Electrical and Electronics Engineers in Israel, pp. 255\u2013259 (2006)","DOI":"10.1109\/EEEI.2006.321066"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proc. 35th Annual Symposium on Foundations of Computer Science","author":"P.W. Shor","year":"1994","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Proc. 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE Computer Society Press, Los Alamitos (1994)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Szydlo, M.: Merkle tree traversal in log space and time (preprint, 2003), http:\/\/www.szydlo.com\/","DOI":"10.1007\/978-3-540-24676-3_32"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-540-24676-3_32","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Szydlo","year":"2004","unstructured":"Szydlo, M.: Merkle tree traversal in log space and time. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 541\u2013554. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88403-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T12:58:38Z","timestamp":1557838718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88403-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884026","9783540884033"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88403-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}