{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:06:18Z","timestamp":1764119178105,"version":"3.46.0"},"publisher-location":"Cham","reference-count":68,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486142"},{"type":"electronic","value":"9783031486159"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-48615-9_1","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"3-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Beyond MPC-in-the-Head: Black-Box Constructions of\u00a0Short Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8951-5099","authenticated-orcid":false,"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4059-7628","authenticated-orcid":false,"given":"Mor","family":"Weiss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS, pp. 2087\u20132104 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"1_CR2","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. IACR Cryptol. ePrint Arch. 2022(1608) (2022). https:\/\/eprint.iacr.org\/2022\/1608"},{"key":"1_CR3","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in $$NC^0$$. In: FOCS, pp. 166\u2013175 (2004)"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in $$NC^0$$. SIAM J. Comput. 36(4), 845\u2013888 (2006)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: STOC, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E. Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Forbes, M.A., Gabizon, A., Riabzev, M., Spooner, N.: Zero knowledge protocols from succinct constraint detection. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 172\u2013206. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_6","DOI":"10.1007\/978-3-319-70503-3_6"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 336\u2013365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12","DOI":"10.1007\/978-3-319-70700-6_12"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: optimizations and applications. In: CCS, pp. 2105\u20132122 (2017)","DOI":"10.1145\/3133956.3134107"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Gabizon, A., Virza, M.: Quasi-linear size zero knowledge from linear-algebraic PCPs. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 33\u201364. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_2","DOI":"10.1007\/978-3-662-49099-0_2"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Bootle, J., Chiesa, A., Liu, S.: Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology\u2014EUROCRYPT 2022, LNCS, vol. 13276, pp. 275\u2013304. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_10","DOI":"10.1007\/978-3-031-07085-3_10"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Bhadauria, R., et al.: Ligero++: a new optimized sublinear IOP. In: CCS, pp. 2025\u20132038 (2020)","DOI":"10.1145\/3372297.3417893"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: STOC, pp. 21\u201331 (1991)","DOI":"10.1145\/103418.103428"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., et al.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 37\u201356. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_4","DOI":"10.1007\/0-387-34799-2_4"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Barkol, O., Ishai, Y.: Secure computation of constant-depth circuits with applications to database search problems. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 395\u2013411. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_24","DOI":"10.1007\/11535218_24"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Lattice-based FHE as secure as PKE. In: ITCS, pp. 1\u201312. ACM (2014)","DOI":"10.1145\/2554797.2554799"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Yuen, H.: Quantum garbled circuits. In: STOC, pp. 804\u2013817. ACM (2022)","DOI":"10.1145\/3519935.3520073"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC, pp. 494\u2013503. ACM (2002)","DOI":"10.1145\/509907.509980"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_30","DOI":"10.1007\/11818175_30"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation (extended abstract). In: STOC, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"4","key":"1_CR28","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/s00145-014-9184-y","volume":"28","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Groth, J., Ishai, Y., Peikert, C., Sahai, A., Smith, A.D.: Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs. J. Cryptol. 28(4), 820\u2013843 (2015)","journal-title":"J. Cryptol."},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Weiss, M.: Binary AMD circuits from secure multiparty computation. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 336\u2013366. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_14","DOI":"10.1007\/978-3-662-53641-4_14"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Tauman Kalai, Y., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM 62(4), 27:1\u201327:64 (2015)","DOI":"10.1145\/2699436"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Goyal, V., Lee, C.-K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: a black-box approach. In: FOCS, pp. 51\u201360. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.47"},{"key":"1_CR32","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: ZKBoo: faster zero-knowledge for boolean circuits. In: USENIX, pp. 1069\u20131083 (2016)"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"issue":"1","key":"1_CR34","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 J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"1_CR35","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)","DOI":"10.1145\/28395.28420"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Goyal, V., Ostrovsky, R., Scafuro, A., Visconti, I.: Black-box non-black-box zero knowledge. In: STOC, pp. 515\u2013524 (2014)","DOI":"10.1145\/2591796.2591879"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Rothblum, G.N.: Constant-round interactive proof systems for $$AC^0[2]$$ and $$NC^1$$. In: Goldreich, O. (ed.) Computational Complexity and Property Testing. LNCS, vol. 12050, pp. 326\u2013351. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43662-9_18","DOI":"10.1007\/978-3-030-43662-9_18"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Guan, J., Wichs, D., Zhandry, M.: Incompressible cryptography. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022, Part I, pp. 700\u2013730. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_24","DOI":"10.1007\/978-3-031-06944-4_24"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E., Nielsen, J.B.: OT-combiners via secure computation. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 393\u2013411. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_22","DOI":"10.1007\/978-3-540-78524-8_22"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Hazay, C., Ishai, Y., Marcedone, A., Venkitasubramaniam, M.: Leviosa: Lightweight secure arithmetic computation. In: CCS, pp. 327\u2013344 (2019)","DOI":"10.1145\/3319535.3354258"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-662-53008-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Hazay","year":"2016","unstructured":"Hazay, C., Venkitasubramaniam, M.: On the Power of Secure Two-Party Computation. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 397\u2013429. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_14"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Hazay, C., Venkitasubramaniam, M.: Round-optimal fully black-box zero-knowledge arguments from one-way permutations. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 263\u2013285. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_10","DOI":"10.1007\/978-3-030-03807-6_10"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: The price of active security in cryptographic protocols. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 184\u2013215. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_7","DOI":"10.1007\/978-3-030-45724-2_7"},{"key":"1_CR44","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: Your reputation\u2019s safe with me: framing-free distributed zero-knowledge proofs. IACR Cryptol. ePrint Arch. 2022(1523) (2022). https:\/\/eprint.iacr.org\/2022\/1523 (to appear at TCC 2023)"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: FOCS, pp. 294\u2013304 (2000)","DOI":"10.1109\/SFCS.2000.892118"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 244\u2013256. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_22","DOI":"10.1007\/3-540-45465-9_22"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 406\u2013425. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_23","DOI":"10.1007\/978-3-642-20465-4_23"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"1_CR49","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Prabhakaran, M., Sahai, A., Yu, C.-H.: Secure protocol transformations. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 430\u2013458. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_15","DOI":"10.1007\/978-3-662-53008-5_15"},{"key":"1_CR50","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"1_CR51","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 294\u2013314. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_18","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"1_CR52","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Weiss, M.: Probabilistically checkable proofs of proximity with zero-knowledge. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 121\u2013145. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_6","DOI":"10.1007\/978-3-642-54242-8_6"},{"key":"1_CR53","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC, pp. 20\u201331 (1988)","DOI":"10.1145\/62212.62215"},{"key":"1_CR54","doi-asserted-by":"publisher","unstructured":"Khurana, D., Ostrovsky, R., Srinivasan, A.: Round optimal black-box \u201cCommit-and-Prove\u201d. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 286\u2013313. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_11","DOI":"10.1007\/978-3-030-03807-6_11"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Raz, R.: Interactive PCP. In: ICALP, pp. 536\u2013547 (2008)","DOI":"10.1007\/978-3-540-70583-3_44"},{"issue":"2","key":"1_CR56","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptology 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptology"},{"key":"1_CR57","doi-asserted-by":"publisher","unstructured":"Nassar, S., Rothblum, R.D.: Succinct interactive oracle proofs: applications and limitations. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, Part I, pp. 504\u2013532. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_18","DOI":"10.1007\/978-3-031-15802-5_18"},{"key":"1_CR58","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. IACR Cryptol. ePrint Arch. 2010(556) (2010). https:\/\/eprint.iacr.org\/2010\/556"},{"key":"1_CR59","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Scafuro, A., Venkitasubramanian, M.: Resettably sound zero-knowledge arguments from OWFs - the (semi) black-box way. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 345\u2013374. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_15","DOI":"10.1007\/978-3-662-46494-6_15"},{"key":"1_CR60","doi-asserted-by":"publisher","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of Paillier: homomorphic secret sharing and public-key silent OT. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"1_CR61","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"1_CR62","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Local proofs approaching the witness length (extended abstract). In: FOCS, pp. 846\u2013857. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00083"},{"key":"1_CR63","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. In: STOC, pp. 49\u201362. ACM (2016)","DOI":"10.1145\/2897518.2897652"},{"key":"1_CR64","doi-asserted-by":"publisher","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 687\u2013717. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_23","DOI":"10.1007\/978-3-030-84252-9_23"},{"key":"1_CR65","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: S &P, pp. 926\u2013943 (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"1_CR66","doi-asserted-by":"publisher","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"1_CR67","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"1_CR68","doi-asserted-by":"crossref","unstructured":"Zhang, J., et al.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: CCS, pp. 159\u2013177 (2021)","DOI":"10.1145\/3460120.3484767"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48615-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:02:34Z","timestamp":1764118954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48615-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486142","9783031486159"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48615-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}