{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:40:00Z","timestamp":1725838800801},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662486498"},{"type":"electronic","value":"9783662486504"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48650-4_2","type":"book-chapter","created":{"date-parts":[[2015,11,23]],"date-time":"2015-11-23T14:25:07Z","timestamp":1448288707000},"page":"19-33","source":"Crossref","is-referenced-by-count":0,"title":["An Everlasting Secure Non-interactive Timestamping Scheme in the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Assia","family":"Ben Shil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaouther","family":"Blibech Sinaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,24]]},"reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TIT.2002.1003845","volume":"48","author":"Y Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48(6), 1668\u20131680 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR2","first-page":"329","volume-title":"Sequences91: Methods in Communication, Security and Computer Science","author":"D Bayer","year":"1992","unstructured":"Bayer, D., Haber, S., Stornetta, W.S.: Improving the efficiency and reliability of digital timestamping. In: Capocelli, R., Santis, A.D., Vaccaro, U. (eds.) Sequences91: Methods in Communication, Security and Computer Science, pp. 329\u2013334. Springer, New York (1992)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"JC Benaloh","year":"1994","unstructured":"Benaloh, J.C., de Mare, M.: One-Way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994)"},{"doi-asserted-by":"crossref","unstructured":"Ben Shil, A., Blibech, K., Robbana, R.: A new timestamping schema in the bounded storage model. In: Proceedings of the 3rd Conference on Risks and Security of Internet and Systems, CRiSIS (2008)","key":"2_CR4","DOI":"10.1109\/CRISIS.2008.4757479"},{"unstructured":"Ben Shil, A., Blibech, K., Robbana, R.: A timestamping scheme with eternal security in the bounded storage model. In: Proceedings of the Formal Methods for Security Workshop co-located with the PetriNets-2014 Conference (2014)","key":"2_CR5"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys, International Workshop on Managing Requirements Knowledge., 313\u2013317 (1979)","key":"2_CR6","DOI":"10.1109\/MARK.1979.8817296"},{"key":"2_CR7","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. 3982, pp. 395\u2013405. Springer, Heidelberg (2006)"},{"unstructured":"Blibech, K., Gabillon, A.: A new totally ordered timestamping scheme. In: 5th Conference on Security and Network Architectures SAR (2006)","key":"2_CR8"},{"doi-asserted-by":"crossref","unstructured":"Blibech, K., Gabillon, A.: CHRONOS: an authenticated dictionary based on skip lists for timestamping systems. In: SWS, pp. 84\u201390 (2005)","key":"2_CR9","DOI":"10.1145\/1103022.1103037"},{"issue":"3\u20134","key":"2_CR10","first-page":"249","volume":"26","author":"K Blibech","year":"2007","unstructured":"Blibech, K., Gabillon, A., Bonnecaze, A.: Etude des syst\u00e8mes d\u2019horodatage. Tech. et Sci. Informatiques 26(3\u20134), 249\u2013278 (2007)","journal-title":"Tech. et Sci. Informatiques"},{"unstructured":"Bonnecaze, A., Liardet, P., Gabillon, A., Blibech, K.: A distributed time stamping scheme, 4th Conference on Security and Network Architectures SAR 2005 (2005)","key":"2_CR11"},{"issue":"11\u201312","key":"2_CR12","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1007\/BF03253323","volume":"62","author":"A Bonnecaze","year":"2007","unstructured":"Bonnecaze, A., Trebuchet, P.: Threshold signature for distributed time stamping scheme. Ann. des Telecommun. 62(11\u201312), 1353\u20131364 (2007)","journal-title":"Ann. des Telecommun."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 1462, p. 486. Springer, Heidelberg (1998)"},{"doi-asserted-by":"crossref","unstructured":"Budas, A., Laud, P.R., Schoenmakers, B.: Optimally efficient accountable timestamping. In: Public Key Cryptography (2000)","key":"2_CR14","DOI":"10.1007\/978-3-540-46588-1_20"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-24676-3_8","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.M.: On generating the initial key in the bounded-storage model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 126\u2013137. Springer, Heidelberg (2004)"},{"issue":"2","key":"2_CR16","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 3(2), 99\u2013111 (1991)","journal-title":"J. Cryptology"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"U Maurer","year":"1992","unstructured":"Maurer, U.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptology 5(1), 53\u201366 (1992)","journal-title":"J. Cryptology"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1109\/18.256484","volume":"39","author":"U Maurer","year":"1993","unstructured":"Maurer, U.: Secret key agreement by public discussion. IEEE Trans. Inf. Theory 39, 733\u2013742 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-540-28628-8_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"T Moran","year":"2004","unstructured":"Moran, T., Shaltiel, R., Ta-Shma, A.: Non-interactive timestamping in the bounded storage model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 460\u2013476. Springer, Heidelberg (2004)"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00145-008-9035-9","volume":"22","author":"T Moran","year":"2009","unstructured":"Moran, T., Shaltiel, R., Ta-Shma, A.: Non-interactive timestamping in the bounded storage model. J. Cryptology 22(2), 189\u2013226 (2009)","journal-title":"J. Cryptology"},{"unstructured":"National Institute of Standards and Technology (NIST), Announcement of Weakness in the Secure Hash Standard, Technical report (1994)","key":"2_CR21"},{"issue":"11","key":"2_CR22","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. ACM Commun. 22(11), 612\u2013613 (1979)","journal-title":"ACM Commun."}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency X"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48650-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T21:25:46Z","timestamp":1653600346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48650-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662486498","9783662486504"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48650-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}