{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:52:17Z","timestamp":1767840737845,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"crossref","award":["HR001120C0085"],"award-info":[{"award-number":["HR001120C0085"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"crossref","award":["HR001120C0087"],"award-info":[{"award-number":["HR001120C0087"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A zero-knowledge proof is a cryptographic protocol where a prover can convince a verifier that a statement is true, without revealing any further information except for the truth of the statement. This article is a survey of recent developments in building practical zero-knowledge proof systems using vector oblivious linear evaluation (VOLE), a tool from secure two-party computation. In this work, we attempt to systematize the recent works on VOLE-based Zero-Knowledge proofs and make the state of the art accessible in one document.<\/jats:p>","DOI":"10.1007\/s10623-023-01292-8","type":"journal-article","created":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T15:01:11Z","timestamp":1696172471000},"page":"3527-3561","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Sok: vector OLE-based zero-knowledge protocols"],"prefix":"10.1007","volume":"91","author":[{"given":"Carsten","family":"Baum","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0018-6354","authenticated-orcid":false,"given":"Samuel","family":"Dittmer","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,1]]},"reference":[{"key":"1292_CR1","doi-asserted-by":"crossref","unstructured":"Baum C., Braun L., Munch-Hansen A., Scholl P.: Moz$$\\mathbb{Z} _{2^k}$$arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over $$\\mathbb{Z}_{2^k}$$. To appear at IACR CRYPTO 2022 (2022)","DOI":"10.1007\/978-3-031-15985-5_12"},{"key":"1292_CR2","doi-asserted-by":"publisher","unstructured":"Baum C., Malozemoff A.J., Rosen M.B., Scholl P.: Mac\u2019n\u2019cheese: Zero-knowledge proofs for boolean and arithmetic circuits with nested disjunctions. In: Malkin T., Peikert C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 92\u2013122. Springer, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4.","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"1292_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-030-57990-6_7","volume-title":"SCN 20. LNCS","author":"C Baum","year":"2020","unstructured":"Baum C., Escudero D., Pedrouzo-Ulloa A., Scholl P., Troncoso-Pastoriza J.R.: Efficient protocols for oblivious linear function evaluation from ring-LWE. In: Galdi C., Kolesnikov V. (eds.) SCN 20. LNCS, vol. 12238, pp. 130\u2013149. Springer, Amalfi, Italy (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_7."},{"key":"1292_CR4","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/3460120.3484812","volume-title":"ACM CCS 2021","author":"C Baum","year":"2021","unstructured":"Baum C., Braun L., Munch-Hansen A., Razet B., Scholl P.: Appenzeller to brie: Efficient zero-knowledge proofs for mixed-mode arithmetic and Z2k. In: Vigna G., Shi E. (eds.) ACM CCS 2021, pp. 192\u2013211. ACM Press, Virtual Event, Republic of Korea (2021). https:\/\/doi.org\/10.1145\/3460120.3484812."},{"key":"1292_CR5","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"CRYPTO\u201991. LNCS","author":"D Beaver","year":"1992","unstructured":"Beaver D.: Foundations of secure interactive computing. In: Feigenbaum J. (ed.) CRYPTO\u201991. LNCS, vol. 576, pp. 377\u2013391. Springer, Santa Barbara, CA, USA (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_31."},{"key":"1292_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"EUROCRYPT 2011. LNCS","author":"R Bendlin","year":"2011","unstructured":"Bendlin R., Damg\u00e5rd I., Orlandi C., Zakarias S.: Semi-homomorphic encryption and multiparty computation. In: Paterson K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Tallinn, Estonia (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11."},{"key":"1292_CR7","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"CRYPTO\u00a02013, Part\u00a0II. LNCS","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson E., Chiesa A., Genkin D., Tromer E., Virza M.: SNARKs for C: Verifying program executions succinctly and in zero knowledge. In: Canetti R., Garay J.A. (eds.) CRYPTO\u00a02013, Part\u00a0II. LNCS, vol. 8043, pp. 90\u2013108. Springer, Santa Barbara, CA, USA (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6."},{"key":"1292_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-36594-2_18","volume-title":"TCC 2013. LNCS","author":"N Bitansky","year":"2013","unstructured":"Bitansky N., Chiesa A., Ishai Y., Ostrovsky R., Paneth O.: Succinct non-interactive arguments via linear interactive proofs. In: Sahai A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 315\u2013333. Springer, Tokyo, Japan (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_18."},{"key":"1292_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-26954-8_3","volume-title":"CRYPTO 2019, Part III. LNCS","author":"D Boneh","year":"2019","unstructured":"Boneh D., Boyle E., Corrigan-Gibbs H., Gilboa N., Ishai Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva A., Micciancio D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 67\u201397. Springer, Santa Barbara, CA, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3."},{"key":"1292_CR10","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1145\/3243734.3243868","volume-title":"ACM CCS 2018","author":"E Boyle","year":"2018","unstructured":"Boyle E., Couteau G., Gilboa N., Ishai Y.: Compressing vector OLE. In: Lie D., Mannan M., Backes M., Wang X. (eds.) ACM CCS 2018, pp. 896\u2013912. ACM Press, Toronto, ON, Canada (2018). https:\/\/doi.org\/10.1145\/3243734.3243868."},{"key":"1292_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/3319535.3354255","volume-title":"ACM CCS 2019","author":"E Boyle","year":"2019","unstructured":"Boyle E., Couteau G., Gilboa N., Ishai Y., Kohl L., Rindal P., Scholl P.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro L., Kinder J., Wang X., Katz J. (eds.) ACM CCS 2019, pp. 291\u2013308. ACM Press, London, UK (2019). https:\/\/doi.org\/10.1145\/3319535.3354255."},{"key":"1292_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"CRYPTO 2019, Part III. LNCS","author":"E Boyle","year":"2019","unstructured":"Boyle E., Couteau G., Gilboa N., Ishai Y., Kohl L., Scholl P.: Efficient pseudorandom correlation generators: Silent OT extension and more. In: Boldyreva A., Micciancio D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Santa Barbara, CA, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16."},{"key":"1292_CR13","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"CRYPTO 2020, Part II. LNCS","author":"E Boyle","year":"2020","unstructured":"Boyle E., Couteau G., Gilboa N., Ishai Y., Kohl L., Scholl P.: Efficient pseudorandom correlation generators from ring-LPN. In: Micciancio D., Ristenpart T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 387\u2013416. Springer, Santa Barbara, CA, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14."},{"key":"1292_CR14","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-38348-9_21","volume-title":"EUROCRYPT 2013. LNCS","author":"D Catalano","year":"2013","unstructured":"Catalano D., Fiore D.: Practical homomorphic MACs for arithmetic circuits. In: Johansson T., Nguyen P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 336\u2013352. Springer, Athens, Greece (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_21."},{"key":"1292_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","volume-title":"SCN 10. LNCS","author":"O Catrina","year":"2010","unstructured":"Catrina O., de Hoogh S.: Improved primitives for secure multiparty integer computation. In: Garay J.A., Prisco R.D. (eds.) SCN 10. LNCS, vol. 6280, pp. 182\u2013199. Springer, Amalfi, Italy (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_13."},{"key":"1292_CR16","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"CRYPTO\u201994. LNCS","author":"R Cramer","year":"1994","unstructured":"Cramer R., Damg\u00e5rd I., Schoenmakers B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt Y. (ed.) CRYPTO\u201994. LNCS, vol. 839, pp. 174\u2013187. Springer, Santa Barbara, CA, USA (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_19."},{"key":"1292_CR17","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-319-96881-0_26","volume-title":"CRYPTO\u00a02018, Part\u00a0II. LNCS","author":"R Cramer","year":"2018","unstructured":"Cramer R., Damg\u00e5rd I., Escudero D., Scholl P., Xing C.: SPD $$\\mathbb{Z}_{2^k}$$: Efficient MPC mod $$2^k$$ for dishonest majority. In: Shacham H., Boldyreva A. (eds.) CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992, pp. 769\u2013798. Springer, Santa Barbara, CA, USA (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_26."},{"key":"1292_CR18","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-642-36594-2_35","volume-title":"TCC 2013. LNCS","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd I., Zakarias S.: Constant-overhead secure computation of Boolean circuits using preprocessing. In: Sahai A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 621\u2013641. Springer, Tokyo, Japan (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_35."},{"key":"1292_CR19","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"CRYPTO 2012. LNCS","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd I., Pastro V., Smart N.P., Zakarias S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini R., Canetti R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Santa Barbara, CA, USA (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38."},{"key":"1292_CR20","doi-asserted-by":"publisher","unstructured":"de Castro L., Juvekar C., Vaikuntanathan, V.: Fast vector oblivious linear evaluation from ring learning with errors. In: WAHC \u201921: Proceedings of the 9th on Workshop on Encrypted Computing & Applied Homomorphic Cryptography, Virtual Event, Korea, 15 November 2021, pp. 29\u201341. WAHC@ACM, (2021). https:\/\/doi.org\/10.1145\/3474366.3486928.","DOI":"10.1145\/3474366.3486928"},{"key":"1292_CR21","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-031-06944-4_11","volume-title":"EUROCRYPT 2022, Part I. LNCS","author":"L de Castro","year":"2022","unstructured":"de Castro L., Hazay C., Ishai Y., Vaikuntanathan V., Venkitasubramaniam M.: Asymptotically quasi-optimal cryptography. In: Dunkelman O., Dziembowski S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 303\u2013334. Springer, Trondheim, Norway (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_11."},{"key":"1292_CR22","doi-asserted-by":"crossref","unstructured":"Dittmer S., Ishai Y., Lu S., Ostrovsky R.: Improving Line-Point Zero Knowledge: Two Multiplications for the Price of One. To appear at CCS 2022 (2022)","DOI":"10.1145\/3548606.3559385"},{"key":"1292_CR23","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-Point Zero Knowledge and Its Applications. In: 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021)"},{"key":"1292_CR24","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/978-3-030-56880-1_29","volume-title":"CRYPTO 2020, Part II. LNCS","author":"D Escudero","year":"2020","unstructured":"Escudero D., Ghosh S., Keller M., Rachuri R., Scholl P.: Improved primitives for MPC over mixed arithmetic-binary circuits. In: Micciancio D., Ristenpart T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 823\u2013852. Springer, Santa Barbara, CA, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_29."},{"key":"1292_CR25","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"CRYPTO\u201986. LNCS","author":"A Fiat","year":"1987","unstructured":"Fiat A., Shamir A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko A.M. (ed.) CRYPTO\u201986. LNCS, vol. 263, pp. 186\u2013194. Springer, Santa Barbara, CA, USA (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12."},{"key":"1292_CR26","doi-asserted-by":"publisher","unstructured":"Franzese N., Katz J., Lu S., Ostrovsky R., Wang X., Weng C.: Constant-overhead zero-knowledge for RAM programs. In: Vigna G., Shi E. (eds.) ACM CCS 2021, pp. 178\u2013191. ACM Press, Virtual Event, Republic of Korea (2021). https:\/\/doi.org\/10.1145\/3460120.3484800.","DOI":"10.1145\/3460120.3484800"},{"key":"1292_CR27","doi-asserted-by":"publisher","unstructured":"Frederiksen T.K., Nielsen J.B., Orlandi C.: Privacy-free garbled circuits with applications to efficient zero-knowledge. In: Oswald E., Fischlin M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 191\u2013219. Springer, Sofia, Bulgaria (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_7.","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"1292_CR28","doi-asserted-by":"publisher","unstructured":"Gennaro R., Gentry C., Parno B., Raykova M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson T., Nguyen P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Athens, Greece (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37.","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"1292_CR29","unstructured":"Giacomelli I., Madsen J., Orlandi C.: ZKBoo: Faster zero-knowledge for Boolean circuits. In: Holz T., Savage S. (eds.) USENIX Security 2016, pp. 1069\u20131083. USENIX Association, Austin, TX, USA (2016)."},{"key":"1292_CR30","doi-asserted-by":"publisher","unstructured":"Goldwasser S., Micali S., Rackoff C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th ACM STOC, pp. 291\u2013304. ACM Press, Providence, RI, USA (1985). https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"1292_CR31","unstructured":"Golovnev A., Lee J., Setty S., Thaler J., Wahby R.S.: Brakedown: Linear-time and post-quantum SNARKs for R1CS. Cryptology ePrint Archive, Report 2021\/1043 (2021)"},{"key":"1292_CR32","doi-asserted-by":"crossref","unstructured":"Haque A., Heath D., Kolesnikov V., Lu S., Ostrovsky R., Shah A.: Garbled Circuits With Sublinear Evaluator. Cryptology ePrint Archive, Paper 2022\/797 (2022)","DOI":"10.1007\/978-3-031-06944-4_2"},{"key":"1292_CR33","doi-asserted-by":"publisher","unstructured":"Heath D., Kolesnikov V.: Stacked garbling for disjunctive zero-knowledge proofs. In: Canteaut A., Ishai Y. (eds.) EUROCRYPT 2020, Part III. LNCS, vol. 12107, pp. 569\u2013598. Springer, Zagreb, Croatia (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_19.","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"1292_CR34","doi-asserted-by":"publisher","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Zero-knowledge from secure multiparty computation. In: Johnson D.S., Feige U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press, San Diego, CA, USA (2007). https:\/\/doi.org\/10.1145\/1250790.1250794.","DOI":"10.1145\/1250790.1250794"},{"key":"1292_CR35","doi-asserted-by":"publisher","unstructured":"Jawurek M., Kerschbaum F., Orlandi C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In: Sadeghi A.-R., Gligor V.D., Yung M. (eds.) ACM CCS 2013, pp. 955\u2013966. ACM Press, Berlin, Germany (2013). https:\/\/doi.org\/10.1145\/2508859.2516662.","DOI":"10.1145\/2508859.2516662"},{"key":"1292_CR36","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1145\/2976749.2978357","volume-title":"ACM CCS 2016","author":"M Keller","year":"2016","unstructured":"Keller M., Orsini E., Scholl P.: MASCOT: Faster malicious arithmetic secure computation with oblivious transfer. In: Weippl E.R., Katzenbeisser S., Kruegel C., Myers A.C., Halevi S. (eds.) ACM CCS 2016, pp. 830\u2013842. ACM Press, Vienna, Austria (2016). https:\/\/doi.org\/10.1145\/2976749.2978357."},{"key":"1292_CR37","doi-asserted-by":"publisher","unstructured":"Liu T., Xie X., Zhang Y.: zkCNN: Zero knowledge proofs for convolutional neural network predictions and accuracy. In: Vigna G., Shi E. (eds.) ACM CCS 2021, pp. 2968\u20132985. ACM Press, Virtual Event, Republic of Korea (2021). https:\/\/doi.org\/10.1145\/3460120.3485379.","DOI":"10.1145\/3460120.3485379"},{"key":"1292_CR38","doi-asserted-by":"publisher","unstructured":"Luo N., Antonopoulos T., Harris W.R., Piskac R., Tromer E., Wang X.: Proving UNSAT in zero knowledge. In: Yin H., Stavrou A., Cremers C., Shi E. (eds.) ACM CCS 2022, pp. 2203\u20132217. ACM Press, Los Angeles, CA, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3559373.","DOI":"10.1145\/3548606.3559373"},{"key":"1292_CR39","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/501983.502000","volume-title":"ACM CCS 2001","author":"CA Neff","year":"2001","unstructured":"Neff C.A.: A verifiable secret shuffle and its application to e-voting. In: Reiter M.K., Samarati P. (eds.) ACM CCS 2001, pp. 116\u2013125. ACM Press, Philadelphia, PA, USA (2001). https:\/\/doi.org\/10.1145\/501983.502000."},{"key":"1292_CR40","doi-asserted-by":"publisher","unstructured":"Nielsen J.B., Orlandi C.: LEGO for two-party secure computation. In: Reingold, O (ed.) TCC\u00a02009. LNCS, Vol. 5444, pp. 368\u2013386. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_22","DOI":"10.1007\/978-3-642-00457-5_22"},{"key":"1292_CR41","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"CRYPTO 2012. LNCS","author":"JB Nielsen","year":"2012","unstructured":"Nielsen J.B., Nordholt P.S., Orlandi C., Burra S.S.: A new approach to practical active-secure two-party computation. In: Safavi-Naini R., Canetti R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Santa Barbara, CA, USA (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40."},{"issue":"7","key":"1292_CR42","first-page":"15","volume":"1","author":"\u00d8 Ore","year":"1922","unstructured":"Ore \u00d8.: \u00dcber h\u00f6here kongruenzen. Norsk Mat. Forenings Skrifter 1(7), 15 (1922).","journal-title":"Norsk Mat. Forenings Skrifter"},{"key":"1292_CR43","unstructured":"Parker J., Harris W., Pernsteiner S., Cuellar S., Tromer E.: Proving Information Leaks in Zero Knowledge. private communication, to appear soon"},{"key":"1292_CR44","doi-asserted-by":"publisher","unstructured":"Parno B., Howell J., Gentry C., Raykova M.: Pinocchio: Nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238\u2013252. IEEE Computer Society Press, Berkeley, CA, USA (2013). https:\/\/doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"1292_CR45","unstructured":"PROVENANCE: Making complex zero-knowledge proofs more practical. accessed on Jun 30th 2022"},{"key":"1292_CR46","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-031-15802-5_23","volume-title":"CRYPTO 2022, Part I. LNCS","author":"L Roy","year":"2022","unstructured":"Roy L.: SoftSpokenOT: Quieter OT extension from small-field silent VOLE in the minicrypt model. In: Dodis Y., Shrimpton T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 657\u2013687. Springer, Santa Barbara, CA, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23."},{"key":"1292_CR47","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-319-76578-5_19","volume-title":"PKC 2018, Part I. LNCS","author":"P Scholl","year":"2018","unstructured":"Scholl P.: Extending oblivious transfer with low communication via key-homomorphic PRFs. In: Abdalla M., Dahab R. (eds.) PKC 2018, Part I. LNCS, vol. 10769, pp. 554\u2013583. Springer, Rio de Janeiro, Brazil (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_19."},{"key":"1292_CR48","doi-asserted-by":"publisher","unstructured":"Weng C., Yang K., Katz J., Wang X.: Wolverine: Fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, pp. 1074\u20131091. IEEE Computer Society Press, San Francisco, CA, USA (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"1292_CR49","unstructured":"Weng C., Yang K., Xie X., Katz J., Wang X.: Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning. In: Bailey M., Greenstadt R. (eds.) USENIX Security 2021, pp. 501\u2013518. USENIX Association (2021)"},{"key":"1292_CR50","doi-asserted-by":"publisher","first-page":"2901","DOI":"10.1145\/3548606.3560667","volume-title":"ACM CCS 2022","author":"C Weng","year":"2022","unstructured":"Weng C., Yang K., Yang Z., Xie X., Wang X.: AntMan: Interactive zero-knowledge proofs with sublinear communication. In: Yin H., Stavrou A., Cremers C., Shi E. (eds.) ACM CCS 2022, pp. 2901\u20132914. ACM Press, Los Angeles, CA, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3560667."},{"key":"1292_CR51","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1145\/3372297.3417276","volume-title":"ACM CCS 2020","author":"K Yang","year":"2020","unstructured":"Yang K., Weng C., Lan X., Zhang J., Wang X.: Ferret: Fast extension for correlated OT with small communication. In: Ligatti J., Ou X., Katz J., Vigna G. (eds.) ACM CCS 2020, pp. 1607\u20131626. ACM Press, Virtual Event, USA (2020). https:\/\/doi.org\/10.1145\/3372297.3417276."},{"key":"1292_CR52","doi-asserted-by":"publisher","first-page":"2986","DOI":"10.1145\/3460120.3484556","volume-title":"ACM CCS 2021","author":"K Yang","year":"2021","unstructured":"Yang K., Sarkar P., Weng C., Wang X.: QuickSilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: Vigna G., Shi E. (eds.) ACM CCS 2021, pp. 2986\u20133001. ACM Press, Virtual Event, Republic of Korea (2021). https:\/\/doi.org\/10.1145\/3460120.3484556."},{"key":"1292_CR53","doi-asserted-by":"publisher","unstructured":"Zahur S., Rosulek M., Evans D.: Two halves make a whole - reducing data transfer in garbled circuits using half gates. In: Oswald E., Fischlin M. (eds.) EUROCRYPT 2015, Part II. LNCS, vol. 9057, pp. 220\u2013250. Springer, Sofia, Bulgaria (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_8.","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"1292_CR54","doi-asserted-by":"publisher","unstructured":"Zhang J., Liu T., Wang W., Zhang Y., Song D., Xie X., Zhang Y.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: Vigna G., Shi E. (eds.) ACM CCS 2021, pp. 159\u2013177. ACM Press, Virtual Event, Republic of Korea (2021). https:\/\/doi.org\/10.1145\/3460120.3484767.","DOI":"10.1145\/3460120.3484767"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01292-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01292-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01292-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T06:32:28Z","timestamp":1711434748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01292-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,1]]},"references-count":54,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1292"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01292-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,1]]},"assertion":[{"value":"16 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}