{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:27:56Z","timestamp":1743154076897,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540887324"},{"type":"electronic","value":"9783540887331"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88733-1_18","type":"book-chapter","created":{"date-parts":[[2008,10,16]],"date-time":"2008-10-16T22:08:02Z","timestamp":1224194882000},"page":"254-267","source":"Crossref","is-referenced-by-count":3,"title":["Can We Construct Unbounded Time-Stamping Schemes from Collision-Free Hash Functions?"],"prefix":"10.1007","author":[{"given":"Ahto","family":"Buldas","sequence":"first","affiliation":[]},{"given":"Margus","family":"Niitsoo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_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: Sequences II: Methods in Communication, Security, and Computer Science, pp. 329\u2013334. Springer, Heidelberg (1993)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/BFb0055749","volume-title":"Advances in Cryptology - CRYPTO 1998","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)"},{"key":"18_CR3","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":"18_CR4","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":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-75670-5_9","volume-title":"Provable Security","author":"A. Buldas","year":"2007","unstructured":"Buldas, A., J\u00fcrgenson, A.: Does secure time-stamping imply collision-free hash functions? In: Susilo, W., Liu, J.K., Mu, Y. (eds.) ProvSec 2007. LNCS, vol.\u00a04784, pp. 138\u2013150. Springer, Heidelberg (2007)"},{"issue":"2","key":"18_CR6","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":"18_CR7","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":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-28628-8_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"C.-Y. Hsiao","year":"2004","unstructured":"Hsiao, C.-Y., Reyzin, L.: Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 92\u2013105. Springer, Heidelberg (2004)"},{"key":"18_CR9","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":"18_CR10","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"},{"issue":"1","key":"18_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J. Radhakrishnan","year":"2000","unstructured":"Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Discrete Mathematics\u00a013(1), 2\u201324 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"18_CR12","unstructured":"Shaltiel, R.: Recent Developments in Explicit Constructions of Extractors. In: Bulletin of the EATCS, vol.\u00a077, pp. 67\u201395 (2002)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"First Theory of Cryptography Conference \u2013 TCC 2004","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT 1998","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","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88733-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T14:21:48Z","timestamp":1551622908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88733-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540887324","9783540887331"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88733-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}