{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:44Z","timestamp":1760202644565},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642353703"},{"type":"electronic","value":"9783642353710"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35371-0_2","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T20:45:18Z","timestamp":1355431518000},"page":"5-24","source":"Crossref","is-referenced-by-count":5,"title":["Stamp and Extend \u2013 Instant But Undeniable Timestamping Based on Lazy Trees"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Krzywiecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"European Commision: Proposal for a regulation of the European Parliament and of the Council on electronic identification and trust services for electronic transactions in the internal market (June 4, 2012)"},{"key":"2_CR2","unstructured":"European Parliament and of the European Council: Directive 1999\/93\/ec of the European Parliament and of the Council of 13 December 1999 on a Community framework for electronic signatures. Official Journal of the European Communities L(13) (January 1, 2000)"},{"key":"2_CR3","unstructured":"Benaloh, J.C., de Mare, M.: Effcient broadcast time-stamping. Technical Report TR-MCS-91-1, Clarkson University Department of Mathematics and Computer Science (1991)"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00196791","volume":"3","author":"S. Haber","year":"1991","unstructured":"Haber, S., Stornetta, W.S.: How to time-stamp a digital document. J. Cryptology\u00a03(2), 99\u2013111 (1991)","journal-title":"J. Cryptology"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"J.C. Benaloh","year":"1994","unstructured":"Benaloh, J.C., de Mare, M.: One-Way Accumulators: A Decentralized Alternative to Digital Signatures (Extended Abstract). In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 274\u2013285. Springer, Heidelberg (1994)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-11799-2_12","volume-title":"Theory of Cryptography","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Mikkelsen, G.L.: Efficient, Robust and Constant-Round Distributed RSA Key Generation. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 183\u2013200. Springer, Heidelberg (2010)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Le, D.P., Bonnecaze, A., Gabillon, A.: Signtiming scheme based on aggregate signature. In: ISI, pp. 145\u2013149. IEEE (2008)","DOI":"10.1109\/ISI.2008.4565044"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-30539-2_35","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"A. Buldas","year":"2004","unstructured":"Buldas, A., Saarepera, M.: On Provably Secure Time-Stamping Schemes. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 500\u2013514. Springer, Heidelberg (2004)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/11556992_26","volume-title":"Information Security","author":"A. Buldas","year":"2005","unstructured":"Buldas, A., Laud, P., Saarepera, M., Willemson, J.: Universally Composable Time-Stamping Schemes with Audit. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 359\u2013373. Springer, Heidelberg (2005)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11767480_4","volume-title":"Applied Cryptography and Network Security","author":"A. Buldas","year":"2006","unstructured":"Buldas, A., Laur, S.: Do Broken Hash Functions Affect the Security of Time-Stamping Schemes? In: Zhou, J., Yung, M., Bao, F. (eds.) ACNS 2006. LNCS, vol.\u00a03989, pp. 50\u201365. Springer, Heidelberg (2006)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-88733-1_18","volume-title":"Provable Security","author":"A. Buldas","year":"2008","unstructured":"Buldas, A., Niitsoo, M.: Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions? In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol.\u00a05324, pp. 254\u2013267. Springer, Heidelberg (2008)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-14081-5_20","volume-title":"Information Security and Privacy","author":"A. Buldas","year":"2010","unstructured":"Buldas, A., Niitsoo, M.: Optimally Tight Security Proofs for Hash-Then-Publish Time-Stamping. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol.\u00a06168, pp. 318\u2013335. Springer, Heidelberg (2010)"},{"key":"2_CR13","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 Interval Time-Stamping. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol.\u00a02433, pp. 357\u2013371. Springer, Heidelberg (2002)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11751595_43","volume-title":"Computational Science and Its Applications - ICCSA 2006","author":"K. Blibech","year":"2006","unstructured":"Blibech, K., Gabillon, A.: A New Timestamping Scheme Based on Skip Lists. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Lagan\u00e1, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol.\u00a03982, pp. 395\u2013405. Springer, Heidelberg (2006)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-89862-7_8","volume-title":"Information Systems Security","author":"D.-P. Le","year":"2008","unstructured":"Le, D.-P., Bonnecaze, A., Gabillon, A.: A Secure Round-Based Timestamping Scheme with Absolute Timestamps (Short Paper). In: Sekar, R., Pujari, A.K. (eds.) ICISS 2008. LNCS, vol.\u00a05352, pp. 116\u2013123. Springer, Heidelberg (2008)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-25283-9_12","volume-title":"Trusted Systems","author":"P. B\u0142a\u015bkiewicz","year":"2011","unstructured":"B\u0142a\u015bkiewicz, P., Kubiak, P., Kuty\u0142owski, M.: Two-Head Dragon Protocol: Preventing Cloning of Signature Keys - Work in Progress. In: Chen, L., Yung, M. (eds.) INTRUST 2010. LNCS, vol.\u00a06802, pp. 173\u2013188. Springer, Heidelberg (2011)"},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"key":"2_CR18","unstructured":"BSI: Elliptic Curve Cryptography. Technische Richtlinie TR-03111 v2.0 (June 28, 2012)"},{"key":"2_CR19","unstructured":"Schnorr, C.: Method for identyfying subscribers and for generating and veryfing electronic signatures in a data exchange system. U.S. Patent 4,995,082 (1991)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45760-7_1","volume-title":"Topics in Cryptology - CT-RSA 2002","author":"B.S. Kaliski Jr.","year":"2002","unstructured":"Kaliski Jr., B.S.: On Hash Function Firewalls in Signature Schemes. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol.\u00a02271, pp. 1\u201316. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Trusted Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35371-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:14:56Z","timestamp":1620134096000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35371-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642353703","9783642353710"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35371-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}