{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:24Z","timestamp":1725570744008},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642173721"},{"type":"electronic","value":"9783642173738"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17373-8_16","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T10:22:55Z","timestamp":1291285375000},"page":"268-282","source":"Crossref","is-referenced-by-count":5,"title":["Efficient String-Commitment from Weak Bit-Commitment"],"prefix":"10.1007","author":[{"given":"Kai-Min","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Jen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: FOCS, pp. 374\u2013383 (1997)","DOI":"10.1109\/SFCS.1997.646126"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-30576-7_2","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2005","unstructured":"Canetti, R., Halevi, S., Steiner, M.: Hardness amplification of weakly verifiable puzzles. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 17\u201333. Springer, Heidelberg (2005)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-00457-5_9","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2009","unstructured":"Dodis, Y., Impagliazzo, R., Jaiswal, R., Kabanets, V.: Security amplification for interactivecryptographic primitives. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 128\u2013145. Springer, Heidelberg (2009)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/3-540-48910-X_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"I. Damg\u00e5rd","year":"1999","unstructured":"Damg\u00e5rd, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 56\u201373. Springer, Heidelberg (1999)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-24676-3_21","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"C. Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 342\u2013360. Springer, Heidelberg (2004)"},{"key":"16_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography. Basic tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic tools. Cambridge University Press, Cambridge (2001)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/11535218_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"T. Holenstein","year":"2005","unstructured":"Holenstein, T., Renner, R.: One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 478\u2013493. Springer, Heidelberg (2005)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-540-78524-8_34","volume-title":"Theory of Cryptography","author":"S. Halevi","year":"2008","unstructured":"Halevi, S., Rabin, T.: Degradation and amplification of computational hardness. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 626\u2013643. Springer, Heidelberg (2008)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Holenstein, T., Schoenebeck, G.: General hardness amplification of predicates and puzzles. CoRR, abs\/1002.3534 (2010)","DOI":"10.1007\/978-3-642-19571-6_2"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-74143-5_28","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"R. Impagliazzo","year":"2007","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V.: Chernoff-type direct product theorems. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 500\u2013516. Springer, Heidelberg (2007)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-11799-2_3","volume-title":"Theory of Cryptography","author":"C.S. Jutla","year":"2010","unstructured":"Jutla, C.S.: Almost optimal bounds for direct product threshold theorem. In: Micciancio, D. (ed.) Theory of Cryptography. LNCS, vol.\u00a05978, pp. 37\u201351. Springer, Heidelberg (2010)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","first-page":"350","volume-title":"CRYPTO 2009","author":"U. Maurer","year":"2009","unstructured":"Maurer, U., Tessaro, S.: Computational indistinguishability amplification: Tight product theorems for system composition. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 350\u2013368. Springer, Heidelberg (2009)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-540-70936-7_5","volume-title":"Theory of Cryptography","author":"K. Pietrzak","year":"2007","unstructured":"Pietrzak, K., Wikstr\u00f6m, D.: Parallel repetition of computationally sound protocols revisited. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 86\u2013102. Springer, Heidelberg (2007)"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","volume":"5","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: Short monotone formulae for the majority function. J. Algorithms\u00a05(3), 363\u2013366 (1984)","journal-title":"J. Algorithms"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-72540-4_32","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"J. Wullschleger","year":"2007","unstructured":"Wullschleger, J.: Oblivious-transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 555\u2013572. Springer, Heidelberg (2007)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: FOCS, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17373-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T09:47:54Z","timestamp":1636883274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17373-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642173721","9783642173738"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17373-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}