{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T17:57:45Z","timestamp":1768413465084,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540759928","type":"print"},{"value":"9783540759935","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-75993-5_13","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T14:36:14Z","timestamp":1194964574000},"page":"150-162","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Trade-Off for Merkle Tree Traversal"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov","family":"Nekrich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Jakobsson, M.: Almost Optimal Hash Sequence Traversal. Financial Cryptography, 102\u2013119 (2002)","DOI":"10.1007\/3-540-36504-4_8"},{"key":"13_CR2","unstructured":"Devanbu, P., Gertz, M., Martel, C., Stublebine, S.G.: Authentic Third Party Data Publication. In: 14th IFIP Workshop on Database Security (2000)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Jakobsson, M.: Fractal Hash Sequence Representation and Traversal. In: ISIT, p. 437 (2002)","DOI":"10.1109\/ISIT.2002.1023709"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Leighton, T., Micali, S., Szydlo, M.: Fractal Merkle Tree Representation and Traversal. In: RSA Cryptographers Track, RSA Security Conference (2003)","DOI":"10.1007\/3-540-36563-X_21"},{"key":"13_CR5","unstructured":"Karpinski, M., Nekrich, Y.: A Note on Traversing Skew Merkle Trees, ECCC Report TR04-118"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-45811-5_28","volume-title":"Information Security","author":"H. Lipmaa","year":"2002","unstructured":"Lipmaa, H.: On Optimal Hash Tree Traversal for Optimal Time Stamping. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 357\u2013371. Springer, Heidelberg (2002)"},{"key":"13_CR7","unstructured":"Merkle, R.: Secrecy, Authentication and Public Key Systems. UMI Research Press (1982)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"R. Merkle","year":"1988","unstructured":"Merkle, R.: A Digital Signature Based on a Conventional Encryption Function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 369\u2013378. Springer, Heidelberg (1988)"},{"key":"13_CR9","unstructured":"Micali, S.: Efficient Certificate Revocation. Technical Report TM-542b, MIT Laboratory for Computer Science (March 22, 1996)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M., Kilian, J.: Zero-Knowledge Sets. In: Proc. 44th FOCS, pp. 80\u201391 (2003)","DOI":"10.1109\/SFCS.2003.1238183"},{"key":"13_CR11","unstructured":"Perrig, A., Canetti, R., Tygar, D., Song, D.: The TESLA Broadcast Authentication Protocol. Cryptobytes\u00a05, 2\u201313"},{"key":"13_CR12","unstructured":"Rivest, R., Shamir, A.: PayWord and MicroMint - Two Simple Micropayment Schemes. CryptoBytes\u00a01, 7\u201311"},{"key":"13_CR13","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":["Communications in Computer and Information Science","E-business and Telecommunication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75993-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T07:44:15Z","timestamp":1737531855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75993-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540759928","9783540759935"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75993-5_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}