{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:31:57Z","timestamp":1755999117078,"version":"3.37.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319686363"},{"type":"electronic","value":"9783319686370"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-68637-0_15","type":"book-chapter","created":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T06:07:56Z","timestamp":1508134076000},"page":"251-260","source":"Crossref","is-referenced-by-count":6,"title":["Long-Term Secure Time-Stamping Using Preimage-Aware Hash Functions"],"prefix":"10.1007","author":[{"given":"Ahto","family":"Buldas","sequence":"first","affiliation":[]},{"given":"Matthias","family":"Geihs","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,17]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-1-4613-9323-8_24","volume-title":"Sequences II: Methods in Communication, Security, and Computer Science","author":"D Bayer","year":"1993","unstructured":"Bayer, D., Haber, S., Stornetta, W.S.: Improving the efficiency and reliability of digital time-stamping. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds.) Sequences II: Methods in Communication, Security, and Computer Science, pp. 329\u2013334. Springer, New York (1993). doi:\n10.1007\/978-1-4613-9323-8_24"},{"key":"15_CR2","unstructured":"Buldas, A., Geihs, M., Buchmann, J.: Long-term secure time-stamping using preimage-aware hash functions. Cryptology ePrint Archive, Report 2017\/754 (2017). \nhttp:\/\/eprint.iacr.org\/2017\/754"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-39059-3_16","volume-title":"Information Security and Privacy","author":"A Buldas","year":"2013","unstructured":"Buldas, A., Laanoja, R.: Security proofs for hash tree time-stamping using hash functions with small output size. In: Boyd, C., Simpson, L. (eds.) ACISP 2013. LNCS, vol. 7959, pp. 235\u2013250. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-39059-3_16"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-540-71677-8_11","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"A Buldas","year":"2007","unstructured":"Buldas, A., Laur, S.: Knowledge-binding commitments with applications in time-stamping. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 150\u2013165. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-71677-8_11"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-85361-9_12","volume-title":"CONCUR 2008 - Concurrency Theory","author":"R Canetti","year":"2008","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Lynch, N., Pereira, O.: Modeling computational security in long-lived systems. In: van Breugal, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 114\u2013130. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-85361-9_12"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-01001-9_22","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"Y Dodis","year":"2009","unstructured":"Dodis, Y., Ristenpart, T., Shrimpton, T.: Salvaging merkle-damg\u00e5rd for practical applications. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 371\u2013388. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-01001-9_22"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Geihs, M., Demirel, D., Buchmann, J.A.: A security analysis of techniques for long-term integrity protection. In: 14th Annual Conference on Privacy, Security and Trust, PST 2016, Auckland, New Zealand, 12\u201314 December 2016, pp. 449\u2013456 (2016)","DOI":"10.1109\/PST.2016.7906995"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/3-540-38424-3_32","volume-title":"Advances in Cryptology-CRYPT0 1990","author":"S Haber","year":"1991","unstructured":"Haber, S., Stornetta, W.S.: How to time-stamp a digital document. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 437\u2013455. Springer, Heidelberg (1991). doi:\n10.1007\/3-540-38424-3_32"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A Certified Digital Signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). doi:\n10.1007\/0-387-34805-0_21"},{"issue":"2","key":"15_CR10","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-11212-1_16","volume-title":"Computer Security - ESORICS 2014","author":"J Schwenk","year":"2014","unstructured":"Schwenk, J.: Modelling time for authenticated key exchange protocols. In: Kuty\u0142owski, M., Vaidya, J. (eds.) ESORICS 2014. LNCS, vol. 8713, pp. 277\u2013294. Springer, Cham (2014). doi:\n10.1007\/978-3-319-11212-1_16"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68637-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,16]],"date-time":"2017-10-16T06:11:40Z","timestamp":1508134300000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68637-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319686363","9783319686370"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68637-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}