{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T14:03:13Z","timestamp":1760623393469,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":57,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609345"},{"type":"electronic","value":"9789819609352"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-0935-2_12","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:33Z","timestamp":1733680893000},"page":"367-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["$$\\textsf{LogRobin}$$++: Optimizing Proofs of Disjunctive Statements in VOLE-Based ZK"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8951-5099","authenticated-orcid":false,"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9589-5182","authenticated-orcid":false,"given":"David","family":"Heath","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0211-1244","authenticated-orcid":false,"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9765-7911","authenticated-orcid":false,"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6062-3531","authenticated-orcid":false,"given":"Yibin","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: Lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017. pp. 2087\u20132104. ACM Press, Dallas, TX, USA (Oct\u00a031\u00a0\u2013\u00a0Nov\u00a02, 2017). https:\/\/doi.org\/10.1145\/3133956.3134104","key":"12_CR1","DOI":"10.1145\/3133956.3134104"},{"doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Delpech de Saint Guilhem, C., Kloo\u00df, M., Orsini, E., Roy, L., Scholl, P.: Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 581\u2013615. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a020\u201324, 2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_19","key":"12_CR2","DOI":"10.1007\/978-3-031-38554-4_19"},{"doi-asserted-by":"publisher","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 (Nov\u00a015\u201319, 2021).https:\/\/doi.org\/10.1145\/3460120.3484812","key":"12_CR3","DOI":"10.1145\/3460120.3484812"},{"doi-asserted-by":"publisher","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}$$. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 329\u2013358. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a015\u201318, 2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_12","key":"12_CR4","DOI":"10.1007\/978-3-031-15985-5_12"},{"issue":"11","key":"12_CR5","doi-asserted-by":"publisher","first-page":"3527","DOI":"10.1007\/S10623-023-01292-8","volume":"91","author":"C Baum","year":"2023","unstructured":"Baum, C., Dittmer, S., Scholl, P., Wang, X.: Sok: vector ole-based zero-knowledge protocols. Des. Codes Cryptogr. 91(11), 3527\u20133561 (2023).https:\/\/doi.org\/10.1007\/S10623-023-01292-8","journal-title":"Des. Codes Cryptogr."},{"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\u00a02021, Part\u00a0IV. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham, Switzerland, Virtual Event (Aug\u00a016\u201320, 2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4","key":"12_CR6","DOI":"10.1007\/978-3-030-84259-8_4"},{"doi-asserted-by":"publisher","unstructured":"Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO\u201995. LNCS, vol.\u00a0963, pp. 97\u2013109. Springer, Berlin, Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a027\u201331, 1995).https:\/\/doi.org\/10.1007\/3-540-44750-4_8","key":"12_CR7","DOI":"10.1007\/3-540-44750-4_8"},{"doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: Decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy. pp. 459\u2013474. IEEE Computer Society Press, Berkeley, CA, USA (May\u00a018\u201321, 2014).https:\/\/doi.org\/10.1109\/SP.2014.36","key":"12_CR8","DOI":"10.1109\/SP.2014.36"},{"doi-asserted-by":"publisher","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.\u00a08043, pp. 90\u2013108. Springer, Berlin, Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a018\u201322, 2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6","key":"12_CR9","DOI":"10.1007\/978-3-642-40084-1_6"},{"doi-asserted-by":"publisher","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (ed.) EUROCRYPT\u00a02011. LNCS, vol.\u00a06632, pp. 169\u2013188. Springer, Berlin, Heidelberg, Germany, Tallinn, Estonia (May\u00a015\u201319, 2011).https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11","key":"12_CR10","DOI":"10.1007\/978-3-642-20465-4_11"},{"doi-asserted-by":"publisher","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 (Oct\u00a015\u201319, 2018).https:\/\/doi.org\/10.1145\/3243734.3243868","key":"12_CR11","DOI":"10.1145\/3243734.3243868"},{"doi-asserted-by":"publisher","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 (Nov\u00a011\u201315, 2019). https:\/\/doi.org\/10.1145\/3319535.3354255","key":"12_CR12","DOI":"10.1145\/3319535.3354255"},{"doi-asserted-by":"publisher","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\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a018\u201322, 2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","key":"12_CR13","DOI":"10.1007\/978-3-030-26954-8_16"},{"unstructured":"Bui, D., Chu, H., Couteau, G., Wang, X., Weng, C., Yang, K., Yu, Y.: An efficient ZK compiler from SIMD circuits to general circuits. Cryptology ePrint Archive, Report 2023\/1610 (2023), https:\/\/eprint.iacr.org\/2023\/1610","key":"12_CR14"},{"doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd FOCS. pp. 136\u2013145. IEEE Computer Society Press, Las Vegas, NV, USA (Oct\u00a014\u201317, 2001).https:\/\/doi.org\/10.1109\/SFCS.2001.959888","key":"12_CR15","DOI":"10.1109\/SFCS.2001.959888"},{"doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC. pp. 494\u2013503. ACM Press, Montr\u00e9al, Qu\u00e9bec, Canada (May\u00a019\u201321, 2002). https:\/\/doi.org\/10.1145\/509907.509980","key":"12_CR16","DOI":"10.1145\/509907.509980"},{"doi-asserted-by":"publisher","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.\u00a0839, pp. 174\u2013187. Springer, Berlin, Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a021\u201325, 1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_19","key":"12_CR17","DOI":"10.1007\/3-540-48658-5_19"},{"issue":"4","key":"12_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(78)90067-4","volume":"7","author":"RA DeMillo","year":"1978","unstructured":"DeMillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193\u2013195 (1978)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"publisher","unstructured":"Dittmer, S., Eldefrawy, K., Graham-Lengrand, S., Lu, S., Ostrovsky, R., Pereira, V.: Boosting the performance of high-assurance cryptography: Parallel execution and optimizing memory access in formally-verified line-point zero-knowledge. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023. pp. 2098\u20132112. ACM Press, Copenhagen, Denmark (Nov\u00a026\u201330, 2023).https:\/\/doi.org\/10.1145\/3576915.3616583","key":"12_CR19","DOI":"10.1145\/3576915.3616583"},{"doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Improving line-point zero knowledge: Two multiplications for the price of one. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022. pp. 829\u2013841. ACM Press, Los Angeles, CA, USA (Nov\u00a07\u201311, 2022). https:\/\/doi.org\/10.1145\/3548606.3559385","key":"12_CR20","DOI":"10.1145\/3548606.3559385"},{"doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-Point Zero Knowledge and Its Applications. In: Tessaro, S. (ed.) 2nd Conference on Information-Theoretic Cryptography (ITC 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0199, pp. 5:1\u20135:24. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2021.5","key":"12_CR21","DOI":"10.4230\/LIPIcs.ITC.2021.5"},{"doi-asserted-by":"publisher","unstructured":"Fang, Z., Darais, D., Near, J.P., Zhang, Y.: Zero knowledge static program analysis. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021. pp. 2951\u20132967. ACM Press, Virtual Event, Republic of Korea (Nov\u00a015\u201319, 2021). https:\/\/doi.org\/10.1145\/3460120.3484795","key":"12_CR22","DOI":"10.1145\/3460120.3484795"},{"doi-asserted-by":"publisher","unstructured":"Goel, A., Green, M., Hall-Andersen, M., Kaptchuk, G.: Stacking sigmas: A framework to compose $$\\Sigma $$-protocols for disjunctions. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 458\u2013487. Springer, Cham, Switzerland, Trondheim, Norway (May\u00a030\u00a0\u2013\u00a0Jun\u00a03, 2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_16","key":"12_CR23","DOI":"10.1007\/978-3-031-07085-3_16"},{"unstructured":"Goel, A., Hall-Andersen, M., Kaptchuk, G.: Dora: Processor expressiveness is (nearly) free in zero-knowledge for ram programs. Cryptology ePrint Archive, Paper 2023\/1749 (2023), https:\/\/eprint.iacr.org\/2023\/1749","key":"12_CR24"},{"doi-asserted-by":"publisher","unstructured":"Goel, A., Hall-Andersen, M., Kaptchuk, G., Spooner, N.: Speed-stacking: Fast sublinear zero-knowledge proofs for disjunctions. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 347\u2013378. Springer, Cham, Switzerland, Lyon, France (Apr\u00a023\u201327, 2023).https:\/\/doi.org\/10.1007\/978-3-031-30617-4_12","key":"12_CR25","DOI":"10.1007\/978-3-031-30617-4_12"},{"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 (May\u00a06\u20138, 1985).https:\/\/doi.org\/10.1145\/22145.22178","key":"12_CR26","DOI":"10.1145\/22145.22178"},{"doi-asserted-by":"publisher","unstructured":"Groth, J., Kohlweiss, M.: One-out-of-many proofs: Or how to leak a secret and spend a coin. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol.\u00a09057, pp. 253\u2013280. Springer, Berlin, Heidelberg, Germany, Sofia, Bulgaria (Apr\u00a026\u201330, 2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_9","key":"12_CR27","DOI":"10.1007\/978-3-662-46803-6_9"},{"unstructured":"Hazay, C., Heath, D., Kolesnikov, V., Venkitasubramaniam, M., Yang, Y.: LogRobin++: Optimizing proofs of disjunctive statements in VOLE-based ZK. Cryptology ePrint Archive, Paper 2024\/1427 (2024), https:\/\/eprint.iacr.org\/2024\/1427","key":"12_CR28"},{"doi-asserted-by":"publisher","unstructured":"Hazay, C., Yang, Y.: Toward malicious constant-rate 2PC via arithmetic garbling. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0V. LNCS, vol. 14655, pp. 401\u2013431. Springer, Cham, Switzerland, Zurich, Switzerland (May\u00a026\u201330, 2024).https:\/\/doi.org\/10.1007\/978-3-031-58740-5_14","key":"12_CR29","DOI":"10.1007\/978-3-031-58740-5_14"},{"doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V.: Stacked garbling for disjunctive zero-knowledge proofs. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12107, pp. 569\u2013598. Springer, Cham, Switzerland, Zagreb, Croatia (May\u00a010\u201314, 2020).https:\/\/doi.org\/10.1007\/978-3-030-45727-3_19","key":"12_CR30","DOI":"10.1007\/978-3-030-45727-3_19"},{"doi-asserted-by":"publisher","unstructured":"Heath, D., Yang, Y., Devecsery, D., Kolesnikov, V.: Zero knowledge for everything and everyone: Fast ZK processor with cached ORAM for ANSI C programs. In: 2021 IEEE Symposium on Security and Privacy. pp. 1538\u20131556. IEEE Computer Society Press, San Francisco, CA, USA (May\u00a024\u201327, 2021).https:\/\/doi.org\/10.1109\/SP40001.2021.00089","key":"12_CR31","DOI":"10.1109\/SP40001.2021.00089"},{"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 (Nov\u00a04\u20138, 2013). https:\/\/doi.org\/10.1145\/2508859.2516662","key":"12_CR32","DOI":"10.1145\/2508859.2516662"},{"issue":"8","key":"12_CR33","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.14778\/3594512.3594513","volume":"16","author":"X Li","year":"2023","unstructured":"Li, X., Weng, C., Xu, Y., Wang, X., Rogers, J.: Zksql: Verifiable and efficient query evaluation with zero-knowledge proofs. Proceedings of the VLDB Endowment 16(8), 1804\u20131816 (2023)","journal-title":"Proceedings of the VLDB Endowment"},{"doi-asserted-by":"publisher","unstructured":"Lin, F., Xing, C., Yao, Y.: More efficient zero-knowledge protocols over $$\\mathbb{Z}_{2^k}$$ via galois rings. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0IX. LNCS, vol. 14928, pp. 424\u2013457. Springer, Cham, Switzerland, Santa Barbara, CA, USA (Aug\u00a018\u201322, 2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_13","key":"12_CR34","DOI":"10.1007\/978-3-031-68400-5_13"},{"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 (Nov\u00a015\u201319, 2021).https:\/\/doi.org\/10.1145\/3460120.3485379","key":"12_CR35","DOI":"10.1145\/3460120.3485379"},{"unstructured":"Lu, T., Wang, H., Qu, W., Wang, Z., He, J., Tao, T., Chen, W., Zhang, J.: An efficient and extensible zero-knowledge proof framework for neural networks. Cryptology ePrint Archive, Paper 2024\/703 (2024), https:\/\/eprint.iacr.org\/2024\/703","key":"12_CR36"},{"unstructured":"Luick, D., Kolesar, J.C., Antonopoulos, T., Harris, W.R., Parker, J., Piskac, R., Tromer, E., Wang, X., Luo, N.: ZKSMT: A VM for proving SMT theorems in zero knowledge. In: Balzarotti, D., Xu, W. (eds.) 33rd USENIX Security Symposium, USENIX Security 2024, Philadelphia, PA, USA, August 14-16, 2024. USENIX Association (2024), https:\/\/www.usenix.org\/conference\/usenixsecurity24\/presentation\/luick","key":"12_CR37"},{"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 (Nov\u00a07\u201311, 2022). https:\/\/doi.org\/10.1145\/3548606.3559373","key":"12_CR38","DOI":"10.1145\/3548606.3559373"},{"unstructured":"Luo, N., Judson, S., Antonopoulos, T., Piskac, R., Wang, X.: ppSAT: Towards two-party private SAT solving. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022. pp. 2983\u20133000. USENIX Association, Boston, MA, USA (Aug\u00a010\u201312, 2022)","key":"12_CR39"},{"unstructured":"Luo, N., Weng, C., Singh, J., Tan, G., Piskac, R., Raykova, M.: Privacy-preserving regular expression matching using nondeterministic finite automata. Cryptology ePrint Archive, Paper 2023\/643 (2023), https:\/\/eprint.iacr.org\/2023\/643","key":"12_CR40"},{"doi-asserted-by":"publisher","unstructured":"Miers, I., Garman, C., Green, M., Rubin, A.D.: Zerocoin: Anonymous distributed E-cash from Bitcoin. In: 2013 IEEE Symposium on Security and Privacy. pp. 397\u2013411. IEEE Computer Society Press, Berkeley, CA, USA (May\u00a019\u201322, 2013). https:\/\/doi.org\/10.1109\/SP.2013.34","key":"12_CR41","DOI":"10.1109\/SP.2013.34"},{"doi-asserted-by":"publisher","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\u00a02012. LNCS, vol.\u00a07417, pp. 681\u2013700. Springer, Berlin, Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a019\u201323, 2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40","key":"12_CR42","DOI":"10.1007\/978-3-642-32009-5_40"},{"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 (May\u00a019\u201322, 2013).https:\/\/doi.org\/10.1109\/SP.2013.47","key":"12_CR43","DOI":"10.1109\/SP.2013.47"},{"doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO\u201991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Berlin, Heidelberg, Germany, Santa Barbara, CA, USA (Aug\u00a011\u201315, 1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9","key":"12_CR44","DOI":"10.1007\/3-540-46766-1_9"},{"doi-asserted-by":"publisher","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: Improved constructions and implementation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019. pp. 1055\u20131072. ACM Press, London, UK (Nov\u00a011\u201315, 2019).https:\/\/doi.org\/10.1145\/3319535.3363228","key":"12_CR45","DOI":"10.1145\/3319535.3363228"},{"issue":"4","key":"12_CR46","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM (JACM) 27(4), 701\u2013717 (1980)","journal-title":"Journal of the ACM (JACM)"},{"unstructured":"Wang, X., Malozemoff, A.J., Katz, J.: EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit (2016)","key":"12_CR47"},{"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 (May\u00a024\u201327, 2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00056","key":"12_CR48","DOI":"10.1109\/SP40001.2021.00056"},{"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 (Aug\u00a011\u201313, 2021)","key":"12_CR49"},{"doi-asserted-by":"publisher","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 (Nov\u00a07\u201311, 2022). https:\/\/doi.org\/10.1145\/3548606.3560667","key":"12_CR50","DOI":"10.1145\/3548606.3560667"},{"doi-asserted-by":"publisher","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 (Nov\u00a015\u201319, 2021). https:\/\/doi.org\/10.1145\/3460120.3484556","key":"12_CR51","DOI":"10.1145\/3460120.3484556"},{"doi-asserted-by":"publisher","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 (Nov\u00a09\u201313, 2020). https:\/\/doi.org\/10.1145\/3372297.3417276","key":"12_CR52","DOI":"10.1145\/3372297.3417276"},{"doi-asserted-by":"publisher","unstructured":"Yang, Y., Heath, D., Hazay, C., Kolesnikov, V., Venkitasubramaniam, M.: Batchman and robin: Batched and non-batched branching for interactive ZK. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023. pp. 1452\u20131466. ACM Press, Copenhagen, Denmark (Nov\u00a026\u201330, 2023). https:\/\/doi.org\/10.1145\/3576915.3623169","key":"12_CR53","DOI":"10.1145\/3576915.3623169"},{"unstructured":"Yang, Y., Heath, D., Hazay, C., Kolesnikov, V., Venkitasubramaniam, M.: Tight zk cpu: Batched zk branching with cost proportional to evaluated instruction. Cryptology ePrint Archive, Paper 2024\/456 (2024), https:\/\/eprint.iacr.org\/2024\/456","key":"12_CR54"},{"doi-asserted-by":"publisher","unstructured":"Yang, Y., Heath, D., Kolesnikov, V., Devecsery, D.: EZEE: epoch parallel zero knowledge for ANSI C. In: 7th IEEE European Symposium on Security and Privacy, EuroS &P 2022, Genoa, Italy, June 6-10, 2022. pp. 109\u2013123. IEEE, Genoa, Italy (2022). https:\/\/doi.org\/10.1109\/EuroSP53844.2022.00015","key":"12_CR55","DOI":"10.1109\/EuroSP53844.2022.00015"},{"doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS. pp. 162\u2013167. IEEE Computer Society Press, Toronto, Ontario, Canada (Oct\u00a027\u201329, 1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","key":"12_CR56","DOI":"10.1109\/SFCS.1986.25"},{"doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: International symposium on symbolic and algebraic manipulation. pp. 216\u2013226. Springer (1979)","key":"12_CR57","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0935-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:02:56Z","timestamp":1733680976000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}