{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T04:34:27Z","timestamp":1747802067727,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":103,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662464960"},{"type":"electronic","value":"9783662464977"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-46497-7_25","type":"book-chapter","created":{"date-parts":[[2015,3,9]],"date-time":"2015-03-09T06:37:58Z","timestamp":1425883078000},"page":"638-667","source":"Crossref","is-referenced-by-count":22,"title":["Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP"],"prefix":"10.1007","author":[{"given":"Omkant","family":"Pandey","sequence":"first","affiliation":[]},{"given":"Manoj","family":"Prabhakaran","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: STOC, pp. 523\u2013532 (2005)","DOI":"10.1145\/1060590.1060669"},{"key":"25_CR2","unstructured":"Applebaum, B.: Bootstrapping obfuscators via fast pseudorandom functions. Cryptology ePrint Archive, Report 2013\/699 (2013), http:\/\/eprint.iacr.org\/2013\/699.pdf"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: FOCS, pp. 106\u2013115 (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"25_CR4","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_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-54242-8_2","volume-title":"Theory of Cryptography","author":"B. Barak","year":"2014","unstructured":"Barak, B., Bitansky, N., Canetti, R., Kalai, Y.T., Paneth, O., Sahai, A.: Obfuscation for evasive functions. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 26\u201351. Springer, Heidelberg (2014)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-14623-7_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"N. Bitansky","year":"2010","unstructured":"Bitansky, N., Canetti, R.: On strong simulation and composable point obfuscation. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 520\u2013537. Springer, Heidelberg (2010)"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for snarks and proof-carrying data. In: STOC, pp. 111\u2013120 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1007\/978-3-642-25385-0_39","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"N. Bitansky","year":"2011","unstructured":"Bitansky, N., Canetti, R., Goldwasser, S., Halevi, S., Kalai, Y.T., Rothblum, G.N.: Program obfuscation with leaky hardware. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 722\u2013739. Springer, Heidelberg (2011)"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-54242-8_3","volume-title":"Theory of Cryptography","author":"E. Boyle","year":"2014","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: On extractability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 52\u201373. Springer, Heidelberg (2014), Preliminary version on Eprint 2013: http:\/\/eprint.iacr.org\/2013\/650.pdf"},{"key":"25_CR10","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: More on the impossibility of virtual-black-box obfuscation with auxiliary input. Cryptology ePrint Archive, Report 2013\/701 (2013), http:\/\/eprint.iacr.org\/2013\/701.pdf"},{"key":"25_CR11","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"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993)"},{"key":"25_CR13","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: Annual IEEE Conference on Computational Complexity (CCC), vol.\u00a017 (2002), Preliminary full version available as Cryptology ePrint Archive, Report 2001\/105."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O., Goldwasser, S., Lindell, Y.: Resettably-sound zero-knowledge and its applications. In: FOCS 2001, pp. 116\u2013125 (2001)","DOI":"10.1109\/SFCS.2001.959886"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. IACR Cryptology ePrint Archive, 2013:631 (2013)","DOI":"10.1007\/978-3-642-55220-5_13"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Telang, S.: Succinct randomized encodings and their applications. Cryptology ePrint Archive, Report 2014\/771 (2014), http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2746539.2746574"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. SIAM Journal on Computing\u00a033(4), 783\u2013818 (2004), Extended abstract appeared in STOC 2002","DOI":"10.1137\/S0097539703427975"},{"key":"25_CR19","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_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-45146-4_18","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"B. Barak","year":"2003","unstructured":"Barak, B., Ong, S.J., Vadhan, S.P.: Derandomization in cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 299\u2013315. Springer, Heidelberg (2003)"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-28628-8_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Palacio, A.: The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 273\u2013289. Springer, Heidelberg (2004)"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O.: From the impossibility of obfuscation to a new non-black-box simulation technique. In: FOCS, pp. 223\u2013232 (2012)","DOI":"10.1109\/FOCS.2012.40"},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-642-28914-9_11","volume-title":"Theory of Cryptography","author":"N. Bitansky","year":"2012","unstructured":"Bitansky, N., Paneth, O.: Point obfuscation and 3-round zero-knowledge. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 190\u2013208. Springer, Heidelberg (2012)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O.: On the impossibility of approximate obfuscation and applications to resettable cryptography. In: STOC, pp. 241\u2013250 (2013)","DOI":"10.1145\/2488608.2488639"},{"key":"25_CR25","unstructured":"Boyle, E., Pass, R.: Limits of extractability assumptions with distributional auxiliary input. Cryptology ePrint Archive, Report 2013\/703 (2013), http:\/\/eprint.iacr.org\/2013\/703.pdf"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-40084-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Z. Brakerski","year":"2013","unstructured":"Brakerski, Z., Rothblum, G.N.: Obfuscating conjunctions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol.\u00a08043, pp. 416\u2013434. Springer, Heidelberg (2013)"},{"key":"25_CR27","unstructured":"Brakerski, Z., Rothblum, G.N.: Virtual black-box obfuscation for all circuits via generic graded encoding. Cryptology ePrint Archive, Report 2013\/563 (2013), http:\/\/eprint.iacr.org\/2013\/563.pdf"},{"issue":"6","key":"25_CR28","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M. Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput.\u00a020(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Comput."},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Cryptology ePrint Archive, Report 2013\/642 (2013), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-44371-2_27"},{"key":"25_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-00457-5_35","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2009","unstructured":"Canetti, R., Dakdouk, R.R.: Towards a theory of extractable functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 595\u2013613. Springer, Heidelberg (2009)"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge. In: Proc. 32th STOC, pp. 235\u2013244 (2000)","DOI":"10.1145\/335305.335334"},{"key":"25_CR32","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Indistinguishability obfuscation of iterated circuits and ram programs. Cryptology ePrint Archive, Report 2014\/769 (2014), http:\/\/eprint.iacr.org\/"},{"key":"25_CR33","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires (almost) logarithmically many rounds. SIAM Journal on Computing\u00a032(1), 1\u201347 (2003), Preliminary version in STOC 2001","DOI":"10.1137\/S0097539701392949"},{"key":"25_CR34","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, pp. 541\u2013550 (2010), Full version: http:\/\/www.cs.cornell.edu\/~rafael\/papers\/ccacommit.pdf","DOI":"10.1109\/FOCS.2010.86"},{"key":"25_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-36594-2_5","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2013","unstructured":"Canetti, R., Lin, H., Paneth, O.: Public-coin concurrent zero-knowledge in the global hash model. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 80\u201399. Springer, Heidelberg (2013)"},{"key":"25_CR36","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Lin, H., Pass, R.: Constant-round concurrent zero knowledge from p-certificates. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.14"},{"key":"25_CR37","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Ostrovsky, R., Pass, R., Visconti, I.: Simultaneous resettability from one-way functions. In: FOCS, pp. 231\u2013240 (2013)","DOI":"10.1109\/FOCS.2013.15"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Pass, R., Seth, K.: Non-black-box simulation from one-way functions and applications to resettable security. In: STOC, pp. 231\u2013240 (2013)","DOI":"10.21236\/ADA582583"},{"key":"25_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-11799-2_5","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2010","unstructured":"Canetti, R., Rothblum, G.N., Varia, M.: Obfuscation of hyperplane membership. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 72\u201389. Springer, Heidelberg (2010)"},{"key":"25_CR40","unstructured":"Canetti, R., Vaikuntanathan, V.: Obfuscating branching programs using black-box pseudo-free groups. IACR Cryptology ePrint Archive, 2013:500 (2013)"},{"key":"25_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/3-540-46766-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"I.B. Damg\u00e5rd","year":"1992","unstructured":"Damg\u00e5rd, I.B.: Towards practical public key systems secure against chosen ciphertext attacks. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 445\u2013456. Springer, Heidelberg (1992)"},{"key":"25_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"I.B. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 418\u2013430. Springer, Heidelberg (2000)"},{"key":"25_CR43","doi-asserted-by":"crossref","unstructured":"Deng, Y., Goyal, V., Sahai, A.: Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy. In: FOCS (2009)","DOI":"10.1109\/FOCS.2009.59"},{"key":"25_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-540-72540-4_9","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., Lin, D.: Instance-dependent verifiable random functions and their application to simultaneous resettability. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 148\u2013168. Springer, Heidelberg (2007)"},{"key":"25_CR45","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M.: Zaps and their applications. In: Proc. 41st FOCS, pp. 283\u2013293 (2000)","DOI":"10.1109\/SFCS.2000.892117"},{"key":"25_CR46","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero knowledge. In: Proc. 30th STOC, pp. 409\u2013418 (1998)","DOI":"10.1145\/276698.276853"},{"key":"25_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/BFb0055746","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"C. Dwork","year":"1998","unstructured":"Dwork, C., Sahai, A.: Concurrent zero-knowledge: Reducing the need for timing constraints. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 442\u2013457. Springer, Heidelberg (1998)"},{"issue":"2","key":"25_CR48","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1987","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-knowledge proofs of identity. Journal of Cryptology\u00a01(2), 77\u201394 (1987), Preliminary version in STOC 1987","journal-title":"Journal of Cryptology"},{"key":"25_CR49","doi-asserted-by":"crossref","unstructured":"Feige, Lapidot, Shamir.: Multiple noninteractive zero knowledge proofs under general assumptions. SIAM Journal on Computing 29 (1999)","DOI":"10.1137\/S0097539792230010"},{"key":"25_CR50","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_CR51","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_CR52","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: FOCS (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"25_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1007\/978-3-662-44371-2_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"S. Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Wichs, D.: On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 518\u2013535. Springer, Heidelberg (2014)"},{"key":"25_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-11799-2_19","volume-title":"Theory of Cryptography","author":"V. Goyal","year":"2010","unstructured":"Goyal, V., Ishai, Y., Sahai, A., Venkatesan, R., Wadia, A.: Founding cryptography on tamper-proof hardware tokens. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 308\u2013326. Springer, Heidelberg (2010)"},{"key":"25_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-36594-2_4","volume-title":"Theory of Cryptography","author":"V. Goyal","year":"2013","unstructured":"Goyal, V., Jain, A., Ostrovsky, R., Richelson, S., Visconti, I.: Concurrent zero knowledge in the bounded player model. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 60\u201379. Springer, Heidelberg (2013)"},{"key":"25_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-22792-9_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S. Garg","year":"2011","unstructured":"Garg, S., Jain, A., Sahai, A.: Leakage-resilient zero knowledge. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 297\u2013315. Springer, Heidelberg (2011), Full version at: http:\/\/www.cs.ucla.edu\/~abhishek\/papers\/lrzk.pdf"},{"key":"25_CR57","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM Journal on Computing\u00a025(1), 169\u2013192 (1996), Preliminary version appeared in Paterson, M. (ed.): ICALP 1990. LNCS, vol.\u00a0443, pp. 268\u2013282. Springer, Heidelberg (1990)"},{"key":"25_CR58","unstructured":"Goldwasser, S., Kalai, Y.T.: On the impossibility of obfuscation with auxiliary input. In: FOCS, pp. 553\u2013562 (2005)"},{"key":"25_CR59","unstructured":"Goldwasser, S., Kalai, Y.T.: A note on the impossibility of obfuscation with auxiliary input. Cryptology ePrint Archive, Report 2013\/665 (2013), http:\/\/eprint.iacr.org\/2013\/665.pdf"},{"key":"25_CR60","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proc. 21st STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"25_CR61","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-662-46494-6_12","volume-title":"TCC 2015, Part II","author":"V. Goyal","year":"2015","unstructured":"Goyal, V., Lin, H., Pandey, O., Pass, R., Sahai, A.: Round-efficient concurrently composable secure computation via a robust extraction lemma. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part I. LNCS, vol.\u00a09014, pp. 260\u2013289. Springer, Heidelberg (2015), Full version of this work available as IACR Eprint Report 2012\/652"},{"key":"25_CR62","doi-asserted-by":"crossref","unstructured":"Goyal, V., Maji, H.K.: Stateless cryptographic protocols. In: FOCS, pp. 678\u2013687 (2011)","DOI":"10.1109\/FOCS.2011.74"},{"key":"25_CR63","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. ACM (1985)","DOI":"10.1145\/22145.22178"},{"key":"25_CR64","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Concurrent zero-knowledge with timing, revisited. In: Proc. 34th STOC, pp. 332\u2013340 (2002)","DOI":"10.1145\/509957.509959"},{"key":"25_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 97\u2013111. Springer, Heidelberg (2006)"},{"key":"25_CR66","doi-asserted-by":"crossref","unstructured":"Goyal, V.: Non-black-box simulation in the fully concurrent setting. In: STOC, pp. 221\u2013230 (2013)","DOI":"10.1145\/2488608.2488637"},{"key":"25_CR67","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-70936-7_11","volume-title":"Theory of Cryptography","author":"S. Goldwasser","year":"2007","unstructured":"Goldwasser, S., Rothblum, G.N.: On best-possible obfuscation. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 194\u2013213. Springer, Heidelberg (2007)"},{"key":"25_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-32009-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S. Garg","year":"2012","unstructured":"Garg, S., Sahai, A.: Adaptively secure multi-party computation with dishonest majority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 105\u2013123. Springer, Heidelberg (2012)"},{"key":"25_CR69","unstructured":"Gupta, D., Sahai, A.: On constant-round concurrent zero-knowledge from a knowledge assumption. CoRR, abs\/1210.3719 (2012)"},{"key":"25_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-44448-3_34","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"S. Hada","year":"2000","unstructured":"Hada, S.: Zero-knowledge and code obfuscation. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 443\u2013457. Springer, Heidelberg (2000)"},{"key":"25_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-13190-5_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S. Hada","year":"2010","unstructured":"Hada, S.: Secure obfuscation for encrypted signatures. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 92\u2013112. Springer, Heidelberg (2010)"},{"key":"25_CR72","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-70936-7_13","volume-title":"Theory of Cryptography","author":"S. Hohenberger","year":"2007","unstructured":"Hohenberger, S., Rothblum, G.N., Shelat, A., Vaikuntanathan, V.: Securely obfuscating re-encryption. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 233\u2013252. Springer, Heidelberg (2007)"},{"key":"25_CR73","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Replacing a random oracle: Full domain hash from indistinguishability obfuscation. In: Cryptology ePrint Archive, Report 2013\/509 (2013), http:\/\/eprint.iacr.org\/2013\/509.pdf"},{"key":"25_CR74","doi-asserted-by":"crossref","unstructured":"Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. Cryptology ePrint Archive, Report 1999\/009 (1999), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/BFb0055744"},{"key":"25_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1007\/978-3-662-46497-7_26","volume-title":"TCC 2015, Part II","author":"Y. Ishai","year":"2015","unstructured":"Ishai, Y., Pandey, O., Sahai, A.: Public-coin differing-inputs obfuscation and its applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol.\u00a09015, pp. 668\u2013697. Springer, Heidelberg (2015), Cryptology Eprint Archive Report 2014\/942"},{"key":"25_CR76","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proc. 24th STOC, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"25_CR77","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-44750-4_25","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"J. Kilian","year":"1995","unstructured":"Kilian, J.: Improved efficient arguments. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 311\u2013324. Springer, Heidelberg (1995)"},{"key":"25_CR78","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E.: Concurrent and resettable zero-knowledge in poly-logarithm rounds. In: STOC, pp. 560\u2013569 (2001)","DOI":"10.1145\/380752.380851"},{"key":"25_CR79","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Rackoff, C.: Lower bounds for zero knowledge on the Internet. In: Proc. 39th FOCS, pp. 484\u2013492 (1998)","DOI":"10.1109\/SFCS.1998.743499"},{"key":"25_CR80","unstructured":"Koppula, V., Ramchen, K., Waters, B.: Separations in circular security for arbitrary length key cycles. Cryptology ePrint Archive, Report 2013\/683 (2013), http:\/\/eprint.iacr.org\/2013\/683.pdf"},{"key":"25_CR81","unstructured":"Lin, H., Pass, R.: Succinct garbling schemes and applications. Cryptology ePrint Archive, Report 2014\/766 (2014), http:\/\/eprint.iacr.org\/"},{"key":"25_CR82","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-24676-3_2","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"B. Lynn","year":"2004","unstructured":"Lynn, B., Prabhakaran, M., Sahai, A.: Positive results and techniques for obfuscation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 20\u201339. Springer, Heidelberg (2004)"},{"key":"25_CR83","doi-asserted-by":"crossref","unstructured":"Micali, S.: CS proofs. In: Proc. 35th FOCS, pp. 436\u2013453 (1994)","DOI":"10.1109\/SFCS.1994.365746"},{"key":"25_CR84","unstructured":"Marcedone, A., Orlandi, C.: Obfuscation (ind-cpa security circular security). Cryptology ePrint Archive, Report 2013\/690 (2013), http:\/\/eprint.iacr.org\/2013\/690.pdf"},{"key":"25_CR85","unstructured":"Moran, T., Rosen, A.: There is no indistinguishability obfuscation in pessiland. Cryptology ePrint Archive, Report 2013\/643 (2013), http:\/\/eprint.iacr.org\/2013\/643.pdf"},{"key":"25_CR86","doi-asserted-by":"crossref","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: FOCS, pp. 120\u2013130 (1999)","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"25_CR87","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_CR88","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-54242-8_7","volume-title":"Theory of Cryptography","author":"O. Pandey","year":"2014","unstructured":"Pandey, O.: Achieving constant round leakage-resilient zero-knowledge. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 146\u2013166. Springer, Heidelberg (2014), Preliminary version on Eprint 2012: http:\/\/eprint.iacr.org\/2012\/362.pdf"},{"key":"25_CR89","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"25_CR90","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_CR91","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1007\/978-3-662-46497-7_25","volume-title":"TCC 2015, Part II","author":"O. Pandey","year":"2015","unstructured":"Pandey, O., Prabhakaran, M., Sahai, A.: Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol.\u00a09015, pp. 638\u2013667. Springer, Heidelberg (2015); Full version of this work available as Cryptology ePrint Archive Report 2013\/754"},{"key":"25_CR92","unstructured":"Pass, R., Rosen, A.: Bounded-concurrent secure two-party computation in a constant number of rounds. In: Proc. 44th FOCS (2003)"},{"key":"25_CR93","unstructured":"Pass, R., Rosen, A.: Concurrent non-malleable commitments. In: FOCS (2005)"},{"key":"25_CR94","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_CR95","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent zero knowledge with logarithmic round-complexity. In: FOCS (2002)"},{"key":"25_CR96","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-11799-2_31","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2010","unstructured":"Pass, R., Tseng, W.-L.D., Venkitasubramaniam, M.: Eye for an eye: Efficient concurrent zero-knowledge in the timing model. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 518\u2013534. Springer, Heidelberg (2010)"},{"key":"25_CR97","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-540-78524-8_30","volume-title":"Theory of Cryptography","author":"R. Pass","year":"2008","unstructured":"Pass, R., Venkitasubramaniam, M.: On constant-round concurrent zero-knowledge. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 553\u2013570. Springer, Heidelberg (2008)"},{"key":"25_CR98","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the concurrent composition of zero-knowledge proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 415\u2013432. Springer, Heidelberg (1999)"},{"key":"25_CR99","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/3-540-44598-6_28","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A. Rosen","year":"2000","unstructured":"Rosen, A.: A note on the round-complexity of concurrent zero-knowledge. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 451\u2013468. Springer, Heidelberg (2000)"},{"key":"25_CR100","unstructured":"Rosen, A.: The Round-Complexity of Black-Box Concurrent Zero-Knowledge. PhD thesis, Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel (2004)"},{"key":"25_CR101","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: Deniable encryption, and more. IACR Cryptology ePrint Archive, 2013:454 (2013)","DOI":"10.1145\/2591796.2591825"},{"key":"25_CR102","doi-asserted-by":"crossref","unstructured":"Tompa, M., Woll, H.: Random self-reducibility and zero-knowledge interactive proofs of possession of information. In: Proc. 28th FOCS, pp. 472\u2013482 (1987)","DOI":"10.1109\/SFCS.1987.49"},{"key":"25_CR103","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: STOC, pp. 523\u2013532 (2005)","DOI":"10.1145\/1060590.1060669"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-46497-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T20:01:09Z","timestamp":1747771269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-46497-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662464960","9783662464977"],"references-count":103,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-46497-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}