{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:10:51Z","timestamp":1725531051709},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642008610"},{"type":"electronic","value":"9783642008627"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00862-7_22","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T09:31:05Z","timestamp":1240911065000},"page":"325-339","source":"Crossref","is-referenced-by-count":11,"title":["Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity"],"prefix":"10.1007","author":[{"given":"Dae Hyun","family":"Yum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae Woo","family":"Seo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungwook","family":"Eom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pil Joong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-62494-5_4","volume-title":"Security Protocols","author":"R.J. Anderson","year":"1997","unstructured":"Anderson, R.J., Manifavas, C., Sutherland, C.: Netcard - a practical electronic-cash system. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol.\u00a01189, pp. 49\u201357. Springer, Heidelberg (1997)"},{"issue":"1","key":"22_CR2","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. Theor. Comput. Sci.\u00a0372(1), 26\u201336 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-36504-4_8","volume-title":"Financial Cryptography","author":"D. Coppersmith","year":"2003","unstructured":"Coppersmith, D., Jakobsson, M.: Almost optimal hash sequence traversal. In: Blaze, M. (ed.) FC 2002. LNCS, vol.\u00a02357, pp. 102\u2013119. Springer, Heidelberg (2003)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-24660-2_26","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"M. Fischlin","year":"2004","unstructured":"Fischlin, M.: Fast verification of hash chains. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol.\u00a02964, pp. 339\u2013352. Springer, Heidelberg (2004)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Haller, N.: The s\/key one-time password system. RFC 1760. Internet Engineering Task Force (1995)","DOI":"10.17487\/rfc1760"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/11496137_29","volume-title":"Applied Cryptography and Network Security","author":"Y.-C. Hu","year":"2005","unstructured":"Hu, Y.-C., Jakobsson, M., Perrig, A.: Efficient constructions for one-way hash chains. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 423\u2013441. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11276-004-4744-y","volume":"11","author":"Y.-C. Hu","year":"2005","unstructured":"Hu, Y.-C., Perrig, A., Johnson, D.B.: Ariadne: A secure on-demand routing protocol for ad hoc networks. Wireless Networks\u00a011(1-2), 21\u201338 (2005)","journal-title":"Wireless Networks"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/3-540-44647-8_20","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"G. Itkis","year":"2001","unstructured":"Itkis, G., Reyzin, L.: Forward-secure signatures with optimal signing and verifying. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 332\u2013354. Springer, Heidelberg (2001)"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1109\/ISIT.2002.1023709","volume-title":"IEEE International Symposium on Information Theory","author":"M. Jakobsson","year":"2002","unstructured":"Jakobsson, M.: Fractal hash sequence representation and traversal. In: IEEE International Symposium on Information Theory, pp. 437\u2013444. IEEE, Los Alamitos (2002); also available at Cryptology ePrint Archive, Report 2002\/001, http:\/\/eprint.iacr.org\/"},{"key":"22_CR10","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":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-45203-4_7","volume-title":"Applied Cryptography and Network Security","author":"S.-R. Kim","year":"2003","unstructured":"Kim, S.-R.: Improved scalable hash chain traversal. In: Zhou, J., Yung, M., Han, Y. (eds.) ACNS 2003. LNCS, vol.\u00a02846, pp. 86\u201395. Springer, Heidelberg (2003)"},{"key":"22_CR12","unstructured":"Perrig, A., Canetti, R., Song, D.X., Tygar, J.D.: Efficient and secure source authentication for multicast. In: NDSS 2001. The Internet Society (2001)"},{"key":"22_CR13","first-page":"56","volume-title":"IEEE Symposium on Security and Privacy","author":"A. Perrig","year":"2000","unstructured":"Perrig, A., Canetti, R., Tygar, J.D., Song, D.X.: Efficient authentication and signing of multicast streams over lossy channels. In: IEEE Symposium on Security and Privacy, pp. 56\u201373. IEEE Computer Society, Los Alamitos (2000)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-62494-5_6","volume-title":"Security Protocols","author":"R.L. Rivest","year":"1997","unstructured":"Rivest, R.L., Shamir, A.: Payword and micromint: Two simple micropayment schemes. In: Lomas, M. (ed.) Security Protocols 1996. LNCS, vol.\u00a01189, pp. 69\u201387. Springer, Heidelberg (1997)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-45126-6_20","volume-title":"Financial Cryptography","author":"Y. Sella","year":"2003","unstructured":"Sella, Y.: On the computation-storage trade-offs of hash chain traversal. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 270\u2013285. Springer, Heidelberg (2003)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-48390-X_17","volume-title":"Financial Cryptography","author":"S.G. Stubblebine","year":"1999","unstructured":"Stubblebine, S.G., Syverson, P.F.: Fair on-line auctions without special trusted parties. In: Franklin, M.K. (ed.) FC 1999. LNCS, vol.\u00a01648, pp. 230\u2013240. Springer, Heidelberg (1999)"},{"key":"22_CR17","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","Topics in Cryptology \u2013 CT-RSA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00862-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:48:40Z","timestamp":1558277320000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00862-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642008610","9783642008627"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00862-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}