{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:29:36Z","timestamp":1768404576597,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":52,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551156","type":"print"},{"value":"9789819551163","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5116-3_19","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:34Z","timestamp":1765106554000},"page":"578-609","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Succinct Line-Point Zero-Knowledge Arguments from\u00a0Homomorphic Secret Sharing"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizhou","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengmeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Abram, D., Damg\u00e5rd, I., Orlandi, C., Scholl, P.: An algebraic framework for silent preprocessing with trustless setup and active security. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022. LNCS, vol. 13510, pp. 421\u2013452. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_15","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Abram, D., Malavolta, G., Roy, L.: Succinct oblivious tensor evaluation and applications: Adaptively-secure laconic function evaluation and trapdoor hashing for all circuits. In: Kouck\u00fd, M., Bansal, N. (eds.) STOC 2025, pp. 1875\u20131886. ACM (2025). https:\/\/doi.org\/10.1145\/3717823.3718164","DOI":"10.1145\/3717823.3718164"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Abram, D., Roy, L., Scholl, P.: Succinct homomorphic secret sharing. In: Joye, M., Leander, G. (eds.) Advances in Cryptology - EUROCRYPT 2024. LNCS, vol. 14656, pp. 301\u2013330. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_11","DOI":"10.1007\/978-3-031-58751-1_11"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: Lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B., Evans, D., Malkin, T., Xu, D. (eds.) CCS 2017, pp. 2087\u20132104. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Koutsougeras, C., Vitter, J.S. (eds.) STOC 1991. pp. 21\u201331. ACM (1991). https:\/\/doi.org\/10.1145\/103418.103428","DOI":"10.1145\/103418.103428"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Baum, C., et al.: One tree to rule them all: Optimizing GGM trees and owfs for post-quantum signatures. In: Chung, K., Sasaki, Y. (eds.) Advances in Cryptology - ASIACRYPT 2024. LNCS, vol. 15484, pp. 463\u2013493. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0875-1_15","DOI":"10.1007\/978-981-96-0875-1_15"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head. In: CRYPTO 2023. LNCS, vol. 14085, pp. 581\u2013615. Springer (2023)","DOI":"10.1007\/978-3-031-38554-4_19"},{"issue":"11","key":"19_CR8","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)","journal-title":"Des. Codes Cryptogr."},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Beullens, W., Seiler, G.: Labrador: Compact proofs for R1CS from module-sis. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023. LNCS, vol. 14085, pp. 518\u2013548. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_17","DOI":"10.1007\/978-3-031-38554-4_17"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/S00145-022-09424-4","volume":"35","author":"N Bitansky","year":"2022","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. J. Cryptol. 35(3), 15 (2022). https:\/\/doi.org\/10.1007\/S00145-022-09424-4","journal-title":"J. Cryptol."},{"key":"19_CR11","doi-asserted-by":"publisher","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.) Advances in Cryptology - CRYPTO 2019. LNCS, vol. 11694, pp. 67\u201397. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: CCS 2018, pp. 896\u2013912. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) CCS 2019, pp. 291\u2013308. ACM (2019). https:\/\/doi.org\/10.1145\/3319535.3354255","DOI":"10.1145\/3319535.3354255"},{"key":"19_CR14","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: CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Meyer, P.: Sublinear-communication secure multiparty computation does not require FHE. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology - EUROCRYPT 2023. LNCS, vol. 14005, pp. 159\u2013189. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_6","DOI":"10.1007\/978-3-031-30617-4_6"},{"key":"19_CR16","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.) Advances in Cryptology - CRYPTO 2016. LNCS, vol.\u00a09814, pp. 509\u2013539. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: Optimizing rounds, communication, and computation. In: Coron, J., Nielsen, J.B. (eds.) Advances in Cryptology - EUROCRYPT 2017. LNCS, vol. 10211, pp. 163\u2013193 (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Lin, H., Tessaro, S.: Foundations of homomorphic secret sharing. In: Karlin, A.R. (ed.) 9th Innovations in Theoretical Computer Science Conference, ITCS 2018. LIPIcs, vol.\u00a094, pp. 21:1\u201321:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.ITCS.2018.21","DOI":"10.4230\/LIPICS.ITCS.2018.21"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2019. LNCS, vol. 11477, pp. 3\u201333. Springer (2019).https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Couteau, G., Kumar, N.: 10-party sublinear secure computation from standard assumptions. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024. LNCS, vol. 14928, pp. 39\u201373. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_2","DOI":"10.1007\/978-3-031-68400-5_2"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 119\u2013136. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-44586-2_9","DOI":"10.1007\/3-540-44586-2_9"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Dao, Q., Ishai, Y., Jain, A., Lin, H.: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023. LNCS, vol. 14082, pp. 315\u2013348. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_11","DOI":"10.1007\/978-3-031-38545-2_11"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Ding, C., Huang, Y.: Phecda: Post-quantum transparent zksnarks from improved polynomial commitment and vole-in-the-head with application in publicly verifiable AES. In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 55\u201355. IEEE Comput. Soc. (2024)","DOI":"10.1109\/SP61157.2025.00055"},{"key":"19_CR24","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: ITC 2021. LIPIcs, vol.\u00a0199, pp. 5:1\u20135:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Halevi, S., Rothblum, R.D., Wichs, D.: Spooky encryption and its applications. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol.\u00a09816, pp. 93\u2013122. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4","DOI":"10.1007\/978-3-662-53015-3_4"},{"issue":"4","key":"19_CR26","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/S00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: snarks for ring arithmetic. J. Cryptol. 36(4), 41 (2023). https:\/\/doi.org\/10.1007\/S00145-023-09481-3","journal-title":"J. Cryptol."},{"key":"19_CR27","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) STOC 1987, pp. 218\u2013229. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"19_CR28","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Dwork, C. (ed.) STOC 2008. pp. 113\u2013122. ACM (2008). https:\/\/doi.org\/10.1145\/1374376.1374396","DOI":"10.1145\/1374376.1374396"},{"issue":"1","key":"19_CR29","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":"19_CR30","doi-asserted-by":"publisher","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: Linear-time and field-agnostic snarks for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 193\u2013226. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J. (eds.) EUROCRYPT 2016. LNCS, vol.\u00a09666, pp. 305\u2013326. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC 2007, pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1250790.1250794"},{"key":"19_CR33","unstructured":"Ishai, Y., Li, H., Lin, H.: Succinct homomorphic macs from groups and applications. IACR Cryptol. ePrint Arch. p.\u00a02073 (2024). https:\/\/eprint.iacr.org\/2024\/2073, to appear in FOCS 2025"},{"key":"19_CR34","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Li, H., Lin, H.: A unified framework for succinct garbling from homomorphic secret sharing. In: Advances in Cryptology - CRYPTO 2025. LNCS, vol. 16003, pp. 390\u2013425. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_13","DOI":"10.1007\/978-3-032-01884-7_13"},{"key":"19_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: CCS 2013, pp. 955\u2013966. ACM (2013). https:\/\/doi.org\/10.1145\/2508859.2516662","DOI":"10.1145\/2508859.2516662"},{"key":"19_CR36","doi-asserted-by":"publisher","unstructured":"Katz, J., Kolesnikov, V., Wang, X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: CCS 2018, pp. 525\u2013537. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243805","DOI":"10.1145\/3243734.3243805"},{"key":"19_CR37","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: On the power of sumcheck in secure multiparty computation. IACR Cryptol. ePrint Arch. (2025), https:\/\/eprint.iacr.org\/2025\/177"},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Lin, F., Xing, C., Yao, Y.: Interactive line-point zero-knowledge with sublinear communication and linear computation. In: Chung, K., Sasaki, Y. (eds.) Advances in Cryptology - ASIACRYPT 2024. LNCS, vol. 15488, pp. 337\u2013366. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0935-2_11","DOI":"10.1007\/978-981-96-0935-2_11"},{"issue":"4","key":"19_CR39","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992). https:\/\/doi.org\/10.1145\/146585.146605","journal-title":"J. ACM"},{"key":"19_CR40","doi-asserted-by":"publisher","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Rate-1 arithmetic garbling from homomorphic secret sharing. In: Boyle, E., Mahmoody, M. (eds.) Theory of Cryptography - 22nd International Conference, TCC 2024. LNCS, vol. 15367, pp. 71\u201397. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_3","DOI":"10.1007\/978-3-031-78023-3_3"},{"key":"19_CR41","doi-asserted-by":"publisher","unstructured":"Meyer, P., Orlandi, C., Roy, L., Scholl, P.: Silent circuit relinearisation: Sublinear-size (boolean and arithmetic) garbled circuits from dcr. In: Advances in Cryptology - CRYPTO 2025. LNCS, vol. 16003, pp. 426\u2013458. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_14","DOI":"10.1007\/978-3-032-01884-7_14"},{"key":"19_CR42","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. (eds.) Advances in Cryptology - EUROCRYPT 2021. LNCS, vol. 12696, pp. 678\u2013708. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"19_CR43","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) Advances in Cryptology - EUROCRYPT \u201999. LNCS, vol.\u00a01592, pp. 223\u2013238. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"19_CR44","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Advances in Cryptology - CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer (1991). https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"19_CR45","doi-asserted-by":"publisher","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology - CRYPTO 2021. LNCS, vol. 12827, pp. 687\u2013717. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_23","DOI":"10.1007\/978-3-030-84252-9_23"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-ole: Improved constructions and implementation. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 1055\u20131072 (2019)","DOI":"10.1145\/3319535.3363228"},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Yang, Z., Xie, X., Wang, X.: Antman: Interactive zero-knowledge proofs with sublinear communication. In: CCS 2022, pp. 2901\u20132914. ACM (2022)","DOI":"10.1145\/3548606.3560667"},{"key":"19_CR48","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 (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: CCS 2021, pp. 2986\u20133001. ACM (2021)","DOI":"10.1145\/3460120.3484556"},{"key":"19_CR50","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.) CCS 2020, pp. 1607\u20131626. ACM (2020).https:\/\/doi.org\/10.1145\/3372297.3417276","DOI":"10.1145\/3372297.3417276"},{"key":"19_CR51","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS 1986, pp. 162\u2013167. IEEE Computer Society (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"19_CR52","doi-asserted-by":"publisher","unstructured":"Zhang, J., et al.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: Kim, Y., Kim, J., Vigna, G., Shi, E. (eds.) CCS \u201921, pp. 159\u2013177. ACM (2021). https:\/\/doi.org\/10.1145\/3460120.3484767","DOI":"10.1145\/3460120.3484767"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5116-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T09:33:32Z","timestamp":1768383212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5116-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551156","9789819551163"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5116-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}