{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:54:19Z","timestamp":1764132859103,"version":"3.40.4"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319108780"},{"type":"electronic","value":"9783319108797"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10879-7_25","type":"book-chapter","created":{"date-parts":[[2014,8,21]],"date-time":"2014-08-21T01:19:04Z","timestamp":1408583944000},"page":"435-454","source":"Crossref","is-referenced-by-count":7,"title":["Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships"],"prefix":"10.1007","author":[{"given":"Abhishek","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS (2002)"},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201345. Springer, Heidelberg (1998)"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-85174-5_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M. Bellare","year":"2008","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic encryption: Definitional equivalences and constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 360\u2013378. Springer, Heidelberg (2008)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: Fairplaymp: a system for secure multi-party computation. In: ACM Conference on Computer and Communications Security (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"25_CR5","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1987)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"issue":"6","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., Santis, A.D., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput.\u00a020(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Comput."},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-10366-7_31","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"A. Boldyreva","year":"2009","unstructured":"Boldyreva, A., Cash, D., Fischlin, M., Warinschi, B.: Foundations of non-malleable hash and one-way functions. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 524\u2013541. Springer, Heidelberg (2009)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"25_CR10","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lin, H., Pass, R.: Adaptive hardness and composable security in the plain model from standard assumptions. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.86"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party computation. In: Proc. 34th STOC, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44987-6_4","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"G. Crescenzo Di","year":"2001","unstructured":"Di Crescenzo, G., Katz, J., Ostrovsky, R., Smith, A.: Efficient and non-interactive non-malleable commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 40. Springer, Heidelberg (2001)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Crescenzo, G.D., Visconti, I.: On defining proofs of knowledge in the bare public key model. In: ICTCS (2007)","DOI":"10.1142\/9789812770998_0020"},{"key":"25_CR16","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), http:\/\/link.springer.de\/link\/service\/series\/0558\/papers\/2139\/21390566.pdf"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: STOC (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: STOC (1991)","DOI":"10.1145\/103418.103474"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM J. Comput.\u00a030(2), 391\u2013437 (electronic) (2000), Preliminary version in STOC 1991","DOI":"10.1137\/S0097539795291562"},{"key":"25_CR20","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: ICS (2010)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"U. Feige","year":"1990","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 (1990)"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: Proc. 22nd STOC, pp. 416\u2013426 (1990)","DOI":"10.1145\/100216.100272"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Garay, J.A., MacKenzie, P.D., Yang, K.: Strengthening zero-knowledge protocols using signatures. J. Cryptology\u00a019(2) (2006)","DOI":"10.1007\/s00145-005-0307-3"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for\u00a0NP. Journal of Cryptology\u00a09(3), 167\u2013189 (Summer 1996)","DOI":"10.1007\/s001459900010"},{"key":"25_CR25","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":"25_CR26","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: STOC (2011)","DOI":"10.1145\/1993636.1993729"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Goyal, V., Lee, C.K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: A black-box approach. In: FOCS (2012)","DOI":"10.1109\/FOCS.2012.47"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Katz, J., Yung, M.: Complete characterization of security notions for probabilistic private-key encryption. In: STOC, pp. 245\u2013254 (2000)","DOI":"10.1145\/335305.335335"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Levin, L.A.: Problems, complete in \u201caverage\u201d instance. In: STOC, p. 465 (1984)","DOI":"10.1145\/800057.808713"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Non-malleability amplification. In: STOC, pp. 189\u2013198 (2009)","DOI":"10.1145\/1536414.1536442"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Lin, H., Pass, R.: Constant-round non-malleable commitments from any one-way function. In: STOC (2011)","DOI":"10.1145\/1993636.1993730"},{"key":"25_CR33","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":"25_CR34","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 (2009)","DOI":"10.1145\/1536414.1536441"},{"key":"25_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y. Lindell","year":"2001","unstructured":"Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 171\u2013189. Springer, Heidelberg (2001), http:\/\/link.springer.de\/link\/service\/series\/0558\/papers\/2139\/21390171.pdf"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"Lindell, Y.: Bounded-concurrent secure two-party computation without setup assumptions. In: Proc. 35th STOC, pp. 683\u2013692 (2003)","DOI":"10.1145\/780637.780641"},{"key":"25_CR37","unstructured":"Lindell, Y.: Constant round zero knowledge proofs of knowledge (2010), http:\/\/eprint.iacr.org\/2010\/487.pdf"},{"key":"25_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-642-20465-4_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"Y. Lindell","year":"2011","unstructured":"Lindell, Y.: Highly-efficient universally-composable commitments based on the DDH assumption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 446\u2013466. Springer, Heidelberg (2011)"},{"key":"25_CR39","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - secure two-party computation system. In: USENIX Security Symposium (2004)"},{"key":"25_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/0-387-34805-0_13","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"M. Naor","year":"1990","unstructured":"Naor, M.: Bit commitment using pseudo-randomness (extended abstract). In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 128\u2013136. Springer, Heidelberg (1990)"},{"key":"25_CR41","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: STOC (1990)","DOI":"10.1145\/100216.100273"},{"key":"25_CR42","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":"25_CR43","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":"25_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a0CRYPTO, pp. 57\u201374. Springer, Heidelberg (2008)"},{"key":"25_CR45","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Proc. 36th STOC, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"},{"key":"25_CR46","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: FOCS (2005)"},{"key":"25_CR47","doi-asserted-by":"crossref","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: STOC (2005)","DOI":"10.1145\/1060590.1060670"},{"key":"25_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-642-13190-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"R. Pass","year":"2010","unstructured":"Pass, R., Wee, H.: Constant-round non-malleable commitments from sub-exponential one-way functions. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 638\u2013655. Springer, Heidelberg (2010)"},{"key":"25_CR49","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS (2002)"},{"key":"25_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-24638-1_11","volume-title":"Theory of Cryptography","author":"A. Rosen","year":"2004","unstructured":"Rosen, A.: A note on constant-round zero-knowledge proofs for NP. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 191\u2013202. Springer, Heidelberg (2004)"},{"key":"25_CR51","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: Proc. 40th FOCS, pp. 543\u2013553 (1999)","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"25_CR52","doi-asserted-by":"crossref","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: FOCS (2010)","DOI":"10.1109\/FOCS.2010.87"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10879-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T08:50:21Z","timestamp":1746348621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10879-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319108780","9783319108797"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10879-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}