{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:45Z","timestamp":1766281005898,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131899"},{"type":"electronic","value":"9783642131905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_32","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T13:16:46Z","timestamp":1274275006000},"page":"638-655","source":"Crossref","is-referenced-by-count":45,"title":["Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Pass","sequence":"first","affiliation":[]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115 (2001)","key":"32_CR1","DOI":"10.1109\/SFCS.2001.959885"},{"doi-asserted-by":"crossref","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS, pp. 345\u2013355 (2002)","key":"32_CR2","DOI":"10.1109\/SFCS.2002.1181957"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-69053-0_20","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Jakobsson, M., Yung, M.: Round-optimal zero-knowledge arguments based on any one-way function. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 280\u2013305. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge. In: STOC, pp. 235\u2013244 (2000)","key":"32_CR4","DOI":"10.1145\/335305.335334"},{"doi-asserted-by":"crossref","unstructured":"Di Crescenzo, G., Ishai, Y., Ostrovsky, R.: Non-interactive and non-malleable commitment. In: Proc. 30th STOC, pp. 141\u2013150 (1998)","key":"32_CR5","DOI":"10.1145\/276698.276722"},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"32_CR7","series-title":"Lecture Notes in Computer Science","first-page":"526","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"U. Feige","year":"1989","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 526\u2013544. Springer, Heidelberg (1989)"},{"issue":"3","key":"32_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptology\u00a09(3), 167\u2013190 (1996)","journal-title":"J. Cryptology"},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput.\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","key":"32_CR10","DOI":"10.1145\/28395.28420"},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM\u00a038(3), 691\u2013729 (1991); Prelim. version in FOCS 1986.","journal-title":"J. ACM"},{"issue":"4","key":"32_CR12","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC, pp. 44\u201361 (1989)","key":"32_CR13","DOI":"10.1145\/73007.73012"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/3-540-39200-9_36","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"J. Katz","year":"2003","unstructured":"Katz, J., Ostrovsky, R., Smith, A.: Round efficiency of multi-party computation with a dishonest majority. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 578\u2013595. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Non-malleability amplification. In: STOC, pp. 189\u2013198 (2009)","key":"32_CR15","DOI":"10.1145\/1536414.1536442"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/978-3-540-78524-8_31","volume-title":"Theory of Cryptography","author":"H. Lin","year":"2008","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: Concurrent non-malleable commitments from any one-way function. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 571\u2013588. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R., Venkitasubramaniam, M.: A unified framework for concurrent security: universal composability from stand-alone non-malleability. In: STOC, pp. 179\u2013188 (2009)","key":"32_CR17","DOI":"10.1145\/1536414.1536441"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-45682-1_23","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"M. Liskov","year":"2001","unstructured":"Liskov, M., Lysyanskaya, A., Micali, S., Reyzin, L., Smith, A.: Mutually independent commitments. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 385\u2013401. Springer, Heidelberg (2001)"},{"issue":"4","key":"32_CR19","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology\u00a04(4), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"32_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-642-00457-5_7","volume-title":"TCC 2009","author":"R. Ostrovsky","year":"2009","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Simulation-based concurrent non-malleable commitments and decommitments. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 91\u2013108. Springer, Heidelberg (2009)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-85174-5_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"O. Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Vaikuntanathan, V.: Adaptive one-way functions and applications. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 57\u201374. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: STOC, pp. 232\u2013241 (2004)","key":"32_CR22","DOI":"10.1145\/1007352.1007393"},{"doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: Bounded-concurrent secure two-party computation in a constant number of rounds. In: FOCS, pp. 404\u2013413 (2003)","key":"32_CR23","DOI":"10.1109\/SFCS.2003.1238214"},{"issue":"2","key":"32_CR24","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/060671553","volume":"38","author":"R. Pass","year":"2008","unstructured":"Pass, R., Rosen, A.: New and improved constructions of nonmalleable cryptographic protocols. SIAM J. Comput.\u00a038(2), 702\u2013752 (2008); Preliminary version in STOC 2005","journal-title":"SIAM J. Comput."},{"issue":"6","key":"32_CR25","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1137\/060661880","volume":"37","author":"R. Pass","year":"2008","unstructured":"Pass, R., Rosen, A.: Concurrent nonmalleable commitments. SIAM J. Comput.\u00a037(6), 1891\u20131925 (2008); Preliminary version in FOCS 2005","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS, pp. 543\u2013553 (1999)","key":"32_CR26","DOI":"10.1109\/SFFCS.1999.814628"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:18:18Z","timestamp":1740093498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}