{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:49:45Z","timestamp":1755838185268,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540209966"},{"type":"electronic","value":"9783540246602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24660-2_26","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:18:44Z","timestamp":1280762324000},"page":"339-352","source":"Crossref","is-referenced-by-count":12,"title":["Fast Verification of Hash Chains"],"prefix":"10.1007","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kohno, T.: Hash Function Balance and its Impact on Birthday Attacks. Number 2003\/65 in Cryptology eprint archive. eprint.iacr.org (2003)","DOI":"10.1007\/978-3-540-24676-3_24"},{"key":"26_CR2","volume-title":"Proceedings of the Annual Conference on Computer and Communications Security (CCS)","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: Proceedings of the Annual Conference on Computer and Communications Security (CCS), ACM Press, New York (1993)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2003)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A., Naor, M.: On Memory-Bound Funtions for Fighting t Spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 426\u2013444. Springer, Heidelberg (2003)"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Haller, N.: The S\/KEY One-Time Password Scheme. Symposium on Network and Distributed Systems Security, pp. 151\u2013157. Internet Society (1994)","DOI":"10.17487\/rfc1760"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Haller, N.: The S\/KEY One-Time Password Scheme (1995)","DOI":"10.17487\/rfc1760"},{"key":"26_CR7","volume-title":"Workshop on Mobile Computing Systems and Applications (WMCSA) 2002","author":"Y.-C. Hu","year":"2002","unstructured":"Hu, Y.-C., Johnson, D., Perrig, A.: SEAD: Secure Efficient Distance Vector Routing in Mobile Wireless Ad Hoc Networks. In: Workshop on Mobile Computing Systems and Applications (WMCSA) 2002, IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"26_CR8","unstructured":"Hu, Y.-C., Perrig, A., Johnson, D.: Efficient Security Mechanisms for Routing Protocols. In: Annual Symposium on Network and Distributed System Security (NDSS 2003), Internet Society (2003)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Hauser, R., Przygienda, A., Tsudik, G.: Reducing the Cost of Security in Link State Routing. In: Annual Symposium on Network and Distributed System Security (NDSS 1997). Internet Society (1997)","DOI":"10.1109\/NDSS.1997.579226"},{"key":"26_CR10","unstructured":"Hauser, R., Steiner, M., Waidner, M.: Micro-Payments Based on iKP. In: Proceedings of SECURICOM 1996, Worldwide Congress on Computer and Communications Security and Protection, pp. 67\u201382 (1996)"},{"key":"26_CR11","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)"},{"issue":"11","key":"26_CR12","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1145\/358790.358797","volume":"24","author":"L. Lamport","year":"1981","unstructured":"Lamport, L.: Password Authentication with Insecure Communication. Communications of the ACM\u00a024(11), 770\u2013772 (1981)","journal-title":"Communications of the ACM"},{"key":"26_CR13","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":"26_CR14","unstructured":"Micali, S.: Efficient Certificate Revocation. Technical Report MIT\/LCS\/TM-542b, MIT Laboratory for Computer Science (1996)"},{"key":"26_CR15","unstructured":"Perrig, A., Canetti, R., Song, D., Tygar, D.: The TESLA Broadcast Authentication Protocol. In: CryptoBytes, vol.\u00a05, pp. 2\u201313. RSA Security (2002)"},{"key":"26_CR16","first-page":"28","volume-title":"Proceedings of the Annual Conference on Computer and Communications Security (CCS)","author":"A. Perrig","year":"2001","unstructured":"Perrig, A.: The BiBa One-Time Signature and Broadcast Authentication Protocol. In: Proceedings of the Annual Conference on Computer and Communications Security (CCS), pp. 28\u201337. ACM Press, New York (2001)"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-62494-5_6","volume-title":"Security Protocols","author":"R. Rivest","year":"1997","unstructured":"Rivest, R., 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":"26_CR18","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 Traversals. In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 270\u2013285. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24660-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:04:58Z","timestamp":1740333898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24660-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540209966","9783540246602"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24660-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}