{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:28:50Z","timestamp":1725888530261},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319600543"},{"type":"electronic","value":"9783319600550"}],"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-60055-0_4","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T02:14:16Z","timestamp":1496110456000},"page":"65-81","source":"Crossref","is-referenced-by-count":3,"title":["Long-Term Secure Commitments via Extractable-Binding Commitments"],"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,5,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"key":"4_CR2","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: Capocelli, R., De Santis, A., Vaccaro, U. (eds.) Sequences II: Methods in Communication, Security, and Computer Science, pp. 329\u2013334. Springer, New York (1993)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, Miami Beach, Florida, 19\u201322 October 1997, pp. 394\u2013403 (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures - how to sign with RSA and rabin. In: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, Advances in Cryptology - EUROCRYPT 1996, Saragossa, Spain, 12\u201316 May 1996, pp. 399\u2013416 (1996)","DOI":"10.1007\/3-540-68339-9_34"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Goldwasser, S., Lin, H., Rubinstein, A., Tromer, E.: The hunting of the SNARK. J. Cryptol. 1\u201378 (2016). doi: 10.1007\/s00145-016-9241-9","DOI":"10.1007\/s00145-016-9241-9"},{"key":"4_CR6","unstructured":"Brassard, G., Cr\u00e9peau, C., Mayers, D., Salvail, L.: A brief review on the impossibility of quantum bit commitment. arXiv preprint quant-ph\/9712023 (1997)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Braun, J., Buchmann, J., Demirel, D., Geihs, M., Fujiwara, M., Moriai, S., Sasaki, M., Waseda, A.: LINCOS: A storage system providing long-term integrity, authenticity, and confidentiality. In: Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, ASIA CCS 2017, pp. 461\u2013468. ACM, New York (2017)","DOI":"10.1145\/3052973.3053043"},{"key":"4_CR8","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: 10.1007\/978-3-540-71677-8_11"},{"key":"4_CR9","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: Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 114\u2013130. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85361-9_12"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-00457-5_35","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2009","unstructured":"Canetti, R., Dakdouk, R.R.: Towards a theory of extractable functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 595\u2013613. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00457-5_35"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44647-8_2"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-36413-7_6","volume-title":"Security in Communication Networks","author":"GD Crescenzo","year":"2003","unstructured":"Crescenzo, G.D.: Equivocable and extractable commitment schemes. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 74\u201387. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36413-7_6"},{"key":"4_CR13","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: 10.1007\/978-3-642-01001-9_22"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Geihs, M., Demirel, D., Buchmann, J.: A security analysis of techniques for long-term integrity protection. In: 2016 14th Annual Conference on Privacy, Security and Trust (PST) (2016)","DOI":"10.1109\/PST.2016.7906995"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 403\u2013418. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-00457-5_24"},{"key":"4_CR16","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: 10.1007\/978-3-319-11212-1_16"},{"issue":"1","key":"4_CR17","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"2","author":"AM Turing","year":"1937","unstructured":"Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proc. London Math. Soc. 2(1), 230\u2013265 (1937)","journal-title":"Proc. London Math. Soc."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Computationally binding quantum commitments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 497\u2013527. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49896-5_18"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60055-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T06:49:40Z","timestamp":1569394180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60055-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319600543","9783319600550"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60055-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}