{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:41:37Z","timestamp":1741153297226,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642195709"},{"type":"electronic","value":"9783642195716"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19571-6_17","type":"book-chapter","created":{"date-parts":[[2011,3,22]],"date-time":"2011-03-22T12:04:42Z","timestamp":1300795482000},"page":"274-292","source":"Crossref","is-referenced-by-count":7,"title":["Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs"],"prefix":"10.1007","author":[{"given":"Huijia","family":"Lin","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G. Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci.\u00a037(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR2","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proc. of the International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: FOCS, pp. 345\u2013354 (2006)","DOI":"10.1109\/FOCS.2006.21"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/SFCS.2001.959888","volume-title":"FOCS 2001: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Washington, DC, USA, p. 136. IEEE Computer Society, Los Alamitos (2001)"},{"key":"17_CR5","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 - CRYPTO 2001","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 19\u201340. Springer, Heidelberg (2001)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-39200-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Canetti","year":"2003","unstructured":"Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 68\u201386. Springer, Heidelberg (2003)"},{"issue":"2","key":"17_CR7","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 Journal on Computing\u00a030(2), 391\u2013437 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-45708-9_37","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 581\u2013596. Springer, Heidelberg (2002)"},{"issue":"6","key":"17_CR9","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C. Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. J. ACM\u00a051(6), 851\u2013898 (2004)","journal-title":"J. ACM"},{"issue":"3","key":"17_CR10","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. Journal of Cryptology\u00a09(3), 167\u2013190 (1996)","journal-title":"Journal of Cryptology"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"690","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 or all languages in NP have zero-knowledge proof systems. J. ACM\u00a038(3), 690\u2013728 (1991)","journal-title":"J. ACM"},{"key":"17_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography \u2014 Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography \u2014 Basic Tools. Cambridge University Press, Cambridge (2001)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. In: STOC 2001, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: STOC 2003, pp. 683\u2013692 (2003)","DOI":"10.1145\/780542.780641"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Non-malleability amplification. In: STOC 2009, pp. 189\u2013198 (2009)","DOI":"10.1145\/1536414.1536442"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/978-3-642-14623-7_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Lin","year":"2010","unstructured":"Lin, H., Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Concurrent non-malleable zero knowledge proofs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 429\u2013446. Springer, Heidelberg (2010)"},{"key":"17_CR18","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)"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11681878_1","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2006","unstructured":"Micciancio, D., Ong, S.J., Sahai, A., Vadhan, S.: Concurrent Zero Knowledge Without Complexity Assumptions. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 1\u201320. Springer, Heidelberg (2006)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-642-11799-2_32","volume-title":"Theory of Cryptography","author":"R. Ostrovsky","year":"2010","unstructured":"Ostrovsky, R., Pandey, O., Visconti, I.: Efficiency preserving transformations for concurrent non-malleable zero knowledge. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 535\u2013552. Springer, Heidelberg (2010)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: STOC 2005, pp. 533\u2013542 (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS 2002, pp. 366\u2013375 (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"17_CR23","unstructured":"Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Concurrent zero knowledge: Simplifications and generalizations(2008) (manuscript), http:\/\/hdl.handle.net\/1813\/10772"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"17_CR25","unstructured":"Yao, A.C.-C., Yung, M., Zhao, Y.: Adaptive concurrent non-malleability with bare public-keys. CoRR, abs\/0910.3282 (2009)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19571-6_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:56:51Z","timestamp":1741107411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19571-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642195709","9783642195716"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19571-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}