{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:42:40Z","timestamp":1780069360029,"version":"3.54.0"},"publisher-location":"Cham","reference-count":82,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780226","type":"print"},{"value":"9783031780233","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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-3-031-78023-3_20","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:50:52Z","timestamp":1733136652000},"page":"614-650","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Homomorphic Secret Sharing with\u00a0Verifiable Evaluation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0452-3426","authenticated-orcid":false,"given":"Arka Rai","family":"Choudhuri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8903-6354","authenticated-orcid":false,"given":"Aarushi","family":"Goel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0888-5133","authenticated-orcid":false,"given":"Aditya","family":"Hegde","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3572-7643","authenticated-orcid":false,"given":"Abhishek","family":"Jain","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"20_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 \u2013 CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 421\u2013452. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_15","DOI":"10.1007\/978-3-031-15985-5_15"},{"key":"20_CR2","unstructured":"Aranha, D.F., Costache, A., Guimar\u00e3es, A., Soria-Vazquez, E.: HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical. Cryptology ePrint Archive, Report 2023\/1949 (2023). https:\/\/eprint.iacr.org\/2023\/1949"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Garg, S., Masny, D., Mukherjee, P.: Reusable two-round MPC from DDH. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020: 18th Theory of Cryptography Conference, Part\u00a0II. LNCS, vol. 12551, pp. 320\u2013348. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_12","DOI":"10.1007\/978-3-030-64378-2_12"},{"issue":"4","key":"20_CR4","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., et al.: The hunting of the SNARK. J. Cryptology 30(4), 989\u20131066 (2017). https:\/\/doi.org\/10.1007\/s00145-016-9241-9","journal-title":"J. Cryptology"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th Annual ACM Symposium on Theory of Computing, pp. 111\u2013120. ACM Press, Palo Alto, CA, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"20_CR6","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: Sahai, A. (ed.) TCC\u00a02013: 10th Theory of Cryptography Conference. LNCS, vol.\u00a07785, pp. 315\u2013333. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_18","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"20_CR7","doi-asserted-by":"publisher","unstructured":"Bitansky, N., et al.: PPAD is as hard as LWE and iterated squaring. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022: 20th Theory of Cryptography Conference, Part\u00a0II. LNCS, vol. 13748, pp. 593\u2013622. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22365-5_21","DOI":"10.1007\/978-3-031-22365-5_21"},{"key":"20_CR8","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R., Vasudevan, P.N.: Batch proofs are statistically hiding. Cryptology ePrint Archive, Report 2023\/754 (2023). https:\/\/eprint.iacr.org\/2023\/754"},{"key":"20_CR9","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 \u2013 CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Lightweight techniques for private heavy hitters. In: 2021 IEEE Symposium on Security and Privacy, pp. 762\u2013776. IEEE Computer Society Press, San Francisco, CA, USA (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00048","DOI":"10.1109\/SP40001.2021.00048"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC\u00a02005: 2nd Theory of Cryptography Conference. LNCS, vol.\u00a03378, pp. 325\u2013341. Springer, Berlin (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_18","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"20_CR12","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: 25th Conference on Computer and Communications Security, pp. 896\u2013912. ACM Press, Toronto, ON, Canada (2018). https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"20_CR13","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.) Advances in Cryptology \u2013 CRYPTO\u00a02019, Part\u00a0III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"20_CR14","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: optimizations and applications. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 2105\u20132122. ACM Press, Dallas, TX, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134107","DOI":"10.1145\/3133956.3134107"},{"key":"20_CR15","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02015, Part\u00a0II. LNCS, vol.\u00a09057, pp. 337\u2013367. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"20_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 \u2013 CRYPTO\u00a02016, Part\u00a0I. LNCS, vol.\u00a09814, pp. 509\u2013539. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19","DOI":"10.1007\/978-3-662-53018-4_19"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: Improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, pp. 1292\u20131303. ACM Press, Vienna, Austria (2017). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: optimizing rounds, communication, and computation. In: Coron, J.S., Nielsen, J.B. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02017, Part\u00a0II. LNCS, vol. 10211, pp. 163\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6","DOI":"10.1007\/978-3-319-56614-6_6"},{"key":"20_CR19","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.) ITCS 2018: 9th Innovations in Theoretical Computer Science Conference. vol.\u00a094, pp. 21:1\u201321:21. LIPIcs, Cambridge, MA, USA (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2018.21","DOI":"10.4230\/LIPIcs.ITCS.2018.21"},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 869\u2013886. ACM Press, London, UK (2019). https:\/\/doi.org\/10.1145\/3319535.3363227","DOI":"10.1145\/3319535.3363227"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Efficient fully secure computation via distributed zero-knowledge proofs. In: Moriai, S., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12493, pp. 244\u2013276. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_9","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Sublinear GMW-style compiler for MPC with preprocessing. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0II. LNCS, vol. 12826, pp. 457\u2013485. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_16","DOI":"10.1007\/978-3-030-84245-1_16"},{"key":"20_CR23","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 \u2013 EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"20_CR24","unstructured":"Bradley, E., Waters, B., Wu, D.J.: Batch arguments to NIZKs from one-way functions. Cryptology ePrint Archive, Report 2023\/1938 (2023). https:\/\/eprint.iacr.org\/2023\/1938"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Holmgren, J., Kalai, Y.T.: Non-interactive delegation and batch NP verification from standard computational assumptions. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th Annual ACM Symposium on Theory of Computing, pp. 474\u2013482. ACM Press, Montreal, QC, Canada (2017). https:\/\/doi.org\/10.1145\/3055399.3055497","DOI":"10.1145\/3055399.3055497"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"de\u00a0Castro, L., Polychroniadou, A.: Lightweight, maliciously secure verifiable function secret sharing. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0I. LNCS, vol. 13275, pp. 150\u2013179. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_6","DOI":"10.1007\/978-3-031-06944-4_6"},{"key":"20_CR27","doi-asserted-by":"publisher","unstructured":"Champion, J., Wu, D.J.: Non-interactive zero-knowledge from non-interactive batch arguments. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 38\u201371. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_2","DOI":"10.1007\/978-3-031-38545-2_2"},{"key":"20_CR28","doi-asserted-by":"publisher","first-page":"43639","DOI":"10.1109\/ACCESS.2023.3271319","volume":"11","author":"X Chen","year":"2023","unstructured":"Chen, X.: Verifiable homomorphic secret sharing for machine learning classifiers. IEEE Access 11, 43639\u201343647 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3271319","journal-title":"IEEE Access"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Chen, X., Zhang, L.F.: Two-server verifiable homomorphic secret sharing for high-degree polynomials. In: Susilo, W., Deng, R.H., Guo, F., Li, Y., Intan, R. (eds.) ISC\u00a02020: 23rd International Conference on Information Security. LNCS, vol. 12472, pp. 75\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62974-8_5","DOI":"10.1007\/978-3-030-62974-8_5"},{"issue":"4","key":"20_CR30","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1109\/TCC.2019.2913375","volume":"9","author":"X Chen","year":"2021","unstructured":"Chen, X., Zhang, L.F.: Two-server delegation of computation on label-encrypted data. IEEE Trans. Cloud Comput. 9(4), 1645\u20131656 (2021). https:\/\/doi.org\/10.1109\/TCC.2019.2913375","journal-title":"IEEE Trans. Cloud Comput."},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Chida, K., et al.: Fast large-scale honest-majority MPC for malicious adversaries. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0III. LNCS, vol. 10993, pp. 34\u201364. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_2","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"20_CR32","unstructured":"Chiesa, A., Lehmkuhl, R., Mishra, P., Zhang, Y.: EOS: efficient private delegation of zkSNARK provers. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023: 32nd USENIX Security Symposium, pp. 6453\u20136469. USENIX Association, Anaheim, CA, USA (2023)"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"Chillotti, I., Orsini, E., Scholl, P., Smart, N.P., Van Leeuwen, B.: Scooby: improved multi-party homomorphic secret sharing based on FHE. In: Galdi, C., Jarecki, S. (eds.) SCN 22: 13th International Conference on Security in Communication Networks. LNCS, vol. 13409, pp. 540\u2013563. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_24","DOI":"10.1007\/978-3-031-14791-3_24"},{"key":"20_CR34","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Garg, S., Jain, A., Jin, Z., Zhang, J.: Correlation intractability and SNARGs from sub-exponential DDH. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 635\u2013668. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_20","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"20_CR35","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Hub\u00e1cek, P., Kamath, C., Pietrzak, K., Rosen, A., Rothblum, G.N.: Finding a NASH equilibrium is no easier than breaking Fiat-Shamir. In: Charikar, M., Cohen, E. (eds.) 51st Annual ACM Symposium on Theory of Computing, pp. 1103\u20131114. ACM Press, Phoenix, AZ, USA (2019). https:\/\/doi.org\/10.1145\/3313276.3316400","DOI":"10.1145\/3313276.3316400"},{"key":"20_CR36","unstructured":"Choudhuri, A.R., Hubacek, P., Kamath, C., Pietrzak, K., Rosen, A., Rothblum, G.N.: PPAD-hardness via iterated squaring modulo a composite. Cryptology ePrint Archive, Report 2019\/667 (2019). https:\/\/eprint.iacr.org\/2019\/667"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive batch arguments for NP from standard assumptions. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0IV. LNCS, vol. 12828, pp. 394\u2013423. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_14","DOI":"10.1007\/978-3-030-84259-8_14"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{P}$$ from LWE. In: 62nd Annual Symposium on Foundations of Computer Science, pp. 68\u201379. IEEE Computer Society Press, Denver, CO, USA (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00016","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"20_CR39","doi-asserted-by":"publisher","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. In: Ishai, Y., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02019, Part\u00a0II. LNCS, vol. 11477, pp. 473\u2013503. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_17","DOI":"10.1007\/978-3-030-17656-3_17"},{"key":"20_CR40","doi-asserted-by":"publisher","unstructured":"Couteau, G., Meyer, P.: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN. In: Canteaut, A., Standaert, F.X. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0II. LNCS, vol. 12697, pp. 842\u2013870. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_29","DOI":"10.1007\/978-3-030-77886-6_29"},{"key":"20_CR41","doi-asserted-by":"publisher","unstructured":"Couteau, G., Meyer, P., Passel\u00e8gue, A., Riahinia, M.: Constrained pseudorandom functions from homomorphic secret sharing. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 194\u2013224. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_7","DOI":"10.1007\/978-3-031-30620-4_7"},{"key":"20_CR42","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Faust, S., Hazay, C.: Secure two-party computation with low communication. In: Cramer, R. (ed.) TCC\u00a02012: 9th Theory of Cryptography Conference. LNCS, vol.\u00a07194, pp. 54\u201374. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_4","DOI":"10.1007\/978-3-642-28914-9_4"},{"key":"20_CR43","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02012. LNCS, vol.\u00a07417, pp. 643\u2013662. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"20_CR44","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 \u2013 CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 315\u2013348. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_11","DOI":"10.1007\/978-3-031-38545-2_11"},{"key":"20_CR45","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.) Advances in Cryptology \u2013 CRYPTO\u00a02016, Part\u00a0III. LNCS, vol.\u00a09816, pp. 93\u2013122. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_4","DOI":"10.1007\/978-3-662-53015-3_4"},{"key":"20_CR46","doi-asserted-by":"publisher","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: Continuous verifiable delay functions. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0III. LNCS, vol. 12107, pp. 125\u2013154. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_5","DOI":"10.1007\/978-3-030-45727-3_5"},{"key":"20_CR47","doi-asserted-by":"publisher","unstructured":"Fazio, N., Gennaro, R., Jafarikhah, T., Skeith III, W.E.: Homomorphic secret sharing from paillier encryption. In: Okamoto, T., Yu, Y., Au, M.H., Li, Y. (eds.) ProvSec 2017: 11th International Conference on Provable Security. LNCS, vol. 10592, pp. 381\u2013399. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68637-0_23","DOI":"10.1007\/978-3-319-68637-0_23"},{"key":"20_CR48","doi-asserted-by":"publisher","unstructured":"Fosli, I., Ishai, Y., Kolobov, V.I., Wootters, M.: On the download rate of homomorphic secret sharing. In: Braverman, M. (ed.) ITCS 2022: 13th Innovations in Theoretical Computer Science Conference. vol.\u00a0215, pp. 71:1\u201371:22. LIPIcs, Berkeley, CA, USA (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2022.71","DOI":"10.4230\/LIPIcs.ITCS.2022.71"},{"key":"20_CR49","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"20_CR50","unstructured":"Garg, S., Goel, A., Jain, A., Policharla, G.V., Sekar, S.: zkSaaS: zero-knowledge SNARKs as a service. In: Calandrino, J.A., Troncoso, C. (eds.) USENIX Security 2023: 32nd USENIX Security Symposium, pp. 4427\u20134444. USENIX Association, Anaheim, CA, USA (2023)"},{"key":"20_CR51","doi-asserted-by":"publisher","unstructured":"Garg, S., Goel, A., Wang, M.: How to prove statements obliviously? In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 449\u2013487. Springer, Cham, (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_14","DOI":"10.1007\/978-3-031-68403-6_14"},{"key":"20_CR52","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: Shmoys, D.B. (ed.) 46th Annual ACM Symposium on Theory of Computing, pp. 495\u2013504. ACM Press, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2591796.2591861","DOI":"10.1145\/2591796.2591861"},{"key":"20_CR53","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.) Advances in Cryptology \u2013 EUROCRYPT\u00a02013. LNCS, vol.\u00a07881, pp. 626\u2013645. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"20_CR54","doi-asserted-by":"publisher","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02014. LNCS, vol.\u00a08441, pp. 640\u2013658. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"20_CR55","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. (ed.) 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM Press, New York City, NY, USA (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"20_CR56","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":"20_CR57","doi-asserted-by":"publisher","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Abe, M. (ed.) Advances in Cryptology \u2013 ASIACRYPT\u00a02010. LNCS, vol.\u00a06477, pp. 321\u2013340. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"20_CR58","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 305\u2013326. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11","DOI":"10.1007\/978-3-662-49896-5_11"},{"issue":"11","key":"20_CR59","doi-asserted-by":"publisher","first-page":"5103","DOI":"10.1007\/S12652-020-01814-5","volume":"11","author":"Y He","year":"2020","unstructured":"He, Y., Zhang, L.F.: Cheater-identifiable homomorphic secret sharing for outsourcing computations. J. Ambient. Intell. Humaniz. Comput. 11(11), 5103\u20135113 (2020). https:\/\/doi.org\/10.1007\/S12652-020-01814-5","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"20_CR60","doi-asserted-by":"publisher","unstructured":"Hulett, J., Jawale, R., Khurana, D., Srinivasan, A.: SNARGs for P from sub-exponential DDH and QR. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0II. LNCS, vol. 13276, pp. 520\u2013549. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_18","DOI":"10.1007\/978-3-031-07085-3_18"},{"key":"20_CR61","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Lai, R.W.F., Malavolta, G.: A geometric approach to homomorphic secret sharing. In: Garay, J. (ed.) PKC\u00a02021: 24th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. LNCS, vol. 12711, pp. 92\u2013119. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_4","DOI":"10.1007\/978-3-030-75248-4_4"},{"key":"20_CR62","doi-asserted-by":"publisher","unstructured":"Jawale, R., Kalai, Y.T., Khurana, D., Zhang, R.Y.: SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. In: Khuller, S., Williams, V.V. (eds.) 53rd Annual ACM Symposium on Theory of Computing, pp. 708\u2013721. ACM Press, Italy (2021). https:\/\/doi.org\/10.1145\/3406325.3451055","DOI":"10.1145\/3406325.3451055"},{"key":"20_CR63","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: Charikar, M., Cohen, E. (eds.) 51st Annual ACM Symposium on Theory of Computing, pp. 1115\u20131124. ACM Press, Phoenix, AZ, USA (2019). https:\/\/doi.org\/10.1145\/3313276.3316411","DOI":"10.1145\/3313276.3316411"},{"key":"20_CR64","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: Delegation with updatable unambiguous proofs and PPAD-hardness. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 652\u2013673. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_23","DOI":"10.1007\/978-3-030-56877-1_23"},{"key":"20_CR65","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th Annual ACM Symposium on Theory of Computing, pp. 723\u2013732. ACM Press, Victoria, BC, Canada (1992). https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"20_CR66","doi-asserted-by":"publisher","unstructured":"Lai, R.W.F., Malavolta, G., Schr\u00f6der, D.: Homomorphic secret sharing for low degree polynomials. In: Peyrin, T., Galbraith, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02018, Part\u00a0III. LNCS, vol. 11274, pp. 279\u2013309. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_11","DOI":"10.1007\/978-3-030-03332-3_11"},{"key":"20_CR67","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Pinkas, B.: Secure two-party computation via cut-and-choose oblivious transfer. In: Ishai, Y. (ed.) TCC\u00a02011: 8th Theory of Cryptography Conference. LNCS, vol.\u00a06597, pp. 329\u2013346. Springer, Berlin (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_20","DOI":"10.1007\/978-3-642-19571-6_20"},{"key":"20_CR68","doi-asserted-by":"publisher","unstructured":"Lipmaa, H.: Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In: Cramer, R. (ed.) TCC\u00a02012: 9th Theory of Cryptography Conference. LNCS, vol.\u00a07194, pp. 169\u2013189. Springer, Berlin (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_10","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"20_CR69","unstructured":"Liu, X., Zhou, Z., Wang, Y., Zhang, B., Yang, X.: Scalable collaborative zk-SNARK: fully distributed proof generation and malicious security. Cryptology ePrint Archive, Report 2024\/143 (2024). https:\/\/eprint.iacr.org\/2024\/143"},{"key":"20_CR70","doi-asserted-by":"publisher","unstructured":"Lombardi, A., Vaikuntanathan, V.: Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0III. LNCS, vol. 12172, pp. 632\u2013651. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_22","DOI":"10.1007\/978-3-030-56877-1_22"},{"key":"20_CR71","doi-asserted-by":"publisher","unstructured":"Micali, S.: CS proofs (extended abstracts). In: 35th Annual Symposium on Foundations of Computer Science, pp. 436\u2013453. IEEE Computer Society Press, Santa Fe, NM, USA (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"20_CR72","unstructured":"Mondal, A., Tiwari, P.R., Gupta, D.: Poster: fully homomorphic secret sharing with output verifiability. NDSS Poster (2022). https:\/\/www.ndss-symposium.org\/wp-content\/uploads\/NDSS2022Poster_paper_36.pdf"},{"key":"20_CR73","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.) Advances in Cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0I. 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":"20_CR74","unstructured":"Ozdemir, A., Boneh, D.: Experimenting with collaborative zk-SNARKs: zero-knowledge proofs for distributed secrets. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022: 31st USENIX Security Symposium, pp. 4291\u20134308. USENIX Association, Boston, MA, USA (2022)"},{"key":"20_CR75","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. SIAM J. Comput. 50(3) (2021)","DOI":"10.1137\/16M1096773"},{"key":"20_CR76","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 \u2013 CRYPTO\u00a02021, Part\u00a0III. 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"},{"issue":"3","key":"20_CR77","doi-asserted-by":"publisher","first-page":"25","DOI":"10.3390\/CRYPTOGRAPHY4030025","volume":"4","author":"G Tsaloli","year":"2020","unstructured":"Tsaloli, G., Banegas, G., Mitrokotsa, A.: Practical and provably secure distributed aggregation: verifiable additive homomorphic secret sharing. Cryptogr. 4(3), 25 (2020). https:\/\/doi.org\/10.3390\/CRYPTOGRAPHY4030025","journal-title":"Cryptogr."},{"key":"20_CR78","doi-asserted-by":"publisher","unstructured":"Tsaloli, G., Liang, B., Mitrokotsa, A.: Verifiable homomorphic secret sharing. In: Baek, J., Susilo, W., Kim, J. (eds.) ProvSec 2018: 12th International Conference on Provable Security. LNCS, vol. 11192, pp. 40\u201355. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01446-9_3","DOI":"10.1007\/978-3-030-01446-9_3"},{"key":"20_CR79","doi-asserted-by":"publisher","unstructured":"Tsaloli, G., Mitrokotsa, A.: Sum it up: verifiable additive homomorphic secret sharing. In: Seo, J.H. (ed.) ICISC 19: 22nd International Conference on Information Security and Cryptology. LNCS, vol. 11975, pp. 115\u2013132. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-40921-0_7","DOI":"10.1007\/978-3-030-40921-0_7"},{"key":"20_CR80","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 433\u2013463. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15","DOI":"10.1007\/978-3-031-15979-4_15"},{"issue":"5","key":"20_CR81","doi-asserted-by":"publisher","first-page":"3233","DOI":"10.1109\/TIT.2018.2886262","volume":"65","author":"M Yoshida","year":"2019","unstructured":"Yoshida, M., Obana, S.: Verifiably multiplicative secret sharing. IEEE Trans. Inf. Theory 65(5), 3233\u20133245 (2019). https:\/\/doi.org\/10.1109\/TIT.2018.2886262","journal-title":"IEEE Trans. Inf. Theory"},{"key":"20_CR82","doi-asserted-by":"publisher","unstructured":"Zhang, L.F., Wang, H.: Multi-server verifiable computation of low-degree polynomials. In: 2022 IEEE Symposium on Security and Privacy, pp. 596\u2013613. IEEE Computer Society Press, San Francisco, CA, USA (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833792","DOI":"10.1109\/SP46214.2022.9833792"}],"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-78023-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:05:47Z","timestamp":1733137547000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":82,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}