{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:53:55Z","timestamp":1764132835488},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642542411"},{"type":"electronic","value":"9783642542428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_8","type":"book-chapter","created":{"date-parts":[[2014,2,2]],"date-time":"2014-02-02T21:42:54Z","timestamp":1391377374000},"page":"167-191","source":"Crossref","is-referenced-by-count":5,"title":["Statistical Concurrent Non-malleable Zero Knowledge"],"prefix":"10.1007","author":[{"given":"Claudio","family":"Orlandi","sequence":"first","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"given":"Vanishree","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Visconti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: FOCS, p. 345 (2006); full version available on eprint arhive","DOI":"10.1109\/FOCS.2006.21"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.: The (true) complexity of statistical zero knowledge. In: STOC, pp. 494\u2013502 (1990)","DOI":"10.1145\/100216.100285"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/11523468_25","volume-title":"Automata, Languages and Programming","author":"D. Catalano","year":"2005","unstructured":"Catalano, D., Visconti, I.: Hybrid trapdoor commitments and their applications. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 298\u2013310. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.tcs.2007.01.007","volume":"374","author":"D. Catalano","year":"2007","unstructured":"Catalano, D., Visconti, I.: Hybrid commitments and their applications to zero-knowledge proof systems. Theor. Comput. Sci.\u00a0374(1-3), 229\u2013260 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Groth, J.: Non-interactive and reusable non-malleable commitment schemes. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9-11, pp. 426\u2013437. ACM (2003)","DOI":"10.1145\/780601.780605"},{"key":"8_CR6","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)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: STOC, pp. 542\u2013552 (1991)","DOI":"10.1145\/103418.103474"},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","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); preliminary version in STOC 1991","journal-title":"SIAM J. Comput."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.P.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: STOC, pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proc. 17th STOC, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"8_CR11","first-page":"652","volume":"2012","author":"V. Goyal","year":"2012","unstructured":"Goyal, V., Lin, H., Pandey, O., Pass, R., Sahai, A.: Round-efficient concurrently composable secure computation via a robust extraction lemma. IACR Cryptology ePrint Archive\u00a02012, 652 (2012)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-540-76900-2_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"V. Goyal","year":"2007","unstructured":"Goyal, V., Moriarty, R., Ostrovsky, R., Sahai, A.: Concurrent statistical zero-knowledge arguments for np from one way functions. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 444\u2013459. Springer, Heidelberg (2007)"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1137\/080725404","volume":"39","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Nguyen, M.H., Ong, S.J., Reingold, O., Vadhan, S.P.: Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM J. Comput.\u00a039(3), 1153\u20131218 (2009)","journal-title":"SIAM J. Comput."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"S. Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 201\u2013215. Springer, Heidelberg (1996)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Non-malleability amplification. In: STOC, pp. 189\u2013198 (2009)","DOI":"10.1145\/1536414.1536442"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-19571-6_17","volume-title":"Theory of Cryptography","author":"H. Lin","year":"2011","unstructured":"Lin, H., Pass, R.: Concurrent non-malleable zero knowledge with adaptive inputs. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 274\u2013292. Springer, Heidelberg (2011)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"8_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":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-36594-2_17","volume-title":"Theory of Cryptography","author":"M. Mahmoody","year":"2013","unstructured":"Mahmoody, M., Xiao, D.: Languages with efficient zero-knowledge pcps are in szk. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 297\u2013314. Springer, Heidelberg (2013)"},{"key":"8_CR20","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)"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jcss.1999.1664","volume":"60","author":"T. Okamoto","year":"2000","unstructured":"Okamoto, T.: On relationships between statistical zero-knowledge proofs. J. Comput. Syst. Sci.\u00a060(1), 47\u2013108 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR22","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":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-540-70583-3_45","volume-title":"Automata, Languages and Programming","author":"R. Ostrovsky","year":"2008","unstructured":"Ostrovsky, R., Persiano, G., Visconti, I.: Constant-round concurrent non-malleable zero knowledge in the bare public-key model. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 548\u2013559. Springer, Heidelberg (2008)"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: Proc. 43rd FOCS (2002)","DOI":"10.1109\/SFCS.2002.1181961"},{"issue":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/636865.636868","volume":"50","author":"A. Sahai","year":"2003","unstructured":"Sahai, A., Vadhan, S.P.: A complete problem for statistical zero knowledge. J. ACM\u00a050(2), 196\u2013249 (2003)","journal-title":"J. ACM"}],"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-54242-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:40:11Z","timestamp":1565149211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}