{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:48Z","timestamp":1725549528653},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540239758"},{"type":"electronic","value":"9783540305392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30539-2_35","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:41:57Z","timestamp":1268401317000},"page":"500-514","source":"Crossref","is-referenced-by-count":25,"title":["On Provably Secure Time-Stamping Schemes"],"prefix":"10.1007","author":[{"given":"Ahto","family":"Buldas","sequence":"first","affiliation":[]},{"given":"M\u00e4rt","family":"Saarepera","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","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: Sequences II: Methods in Communication, Security, and Computer Science, pp. 329\u2013334. Springer, New York (1993)"},{"key":"35_CR2","unstructured":"Benaloh, J., de Mare, M.: Efficient broadcast time-stamping. Tech. report 1, Clarkson Univ. Dep. of Mathematics and Computer Science (August 1991)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/BFb0055749","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"A. Buldas","year":"1998","unstructured":"Buldas, A., Laud, P., Lipmaa, H., Villemson, J.: Time-Stamping with Binary Linking Schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 486\u2013501. Springer, Heidelberg (1998)"},{"issue":"2","key":"35_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. Journal of Cryptology\u00a03(2), 99\u2013111 (1991)","journal-title":"Journal of Cryptology"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Haber, S., Stornetta, W.-S.: Secure Names for Bit-Strings. In: ACM Conference on Computer and Communications Security, pp. 28\u201335 (1997)","DOI":"10.1145\/266420.266430"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: FOCS 2000, 41st IEEE Symposium on the Foundations of Computer Science, pp. 325\u2013335 (2000)","DOI":"10.1109\/SFCS.2000.892121"},{"key":"35_CR7","unstructured":"Hohenberger, S.R.: The Cryptographic Impact of Groups with Infeasible Inversion. Master Thesis. Massachusetts Institute of Technology (May 2003)"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of 21st Annual ACM Symposium on the Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"35_CR9","unstructured":"ISO IEC 18014-3,Time-stamping services \u2013 Part 3: Mechanisms producing linked tokens"},{"key":"35_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and cryptographic applications","author":"M. Luby","year":"1996","unstructured":"Luby, M.: Pseudorandomness and cryptographic applications. Princeton University Press, Princeton (1996)"},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"Merkle, R.C.: Protocols for public-key cryptosystems. In: Proceedings of the 1980 IEEE Symposium on Security and Privacy, pp. 122\u2013134 (1980)","DOI":"10.1109\/SP.1980.10006"},{"key":"35_CR12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00190757","volume":"8","author":"A. Russell","year":"1995","unstructured":"Russell, A.: Necessary and sufficient conditions for collision-free hashing. Journal of Cryptology\u00a08, 87\u201399 (1995)","journal-title":"Journal of Cryptology"},{"key":"35_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Simon","year":"1998","unstructured":"Simon, D.: Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30539-2_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:59:12Z","timestamp":1605761952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30539-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239758","9783540305392"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30539-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}