{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:58:15Z","timestamp":1772276295408,"version":"3.50.1"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031229688","type":"print"},{"value":"9783031229695","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22969-5_18","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:48:42Z","timestamp":1674560922000},"page":"517-546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Non-interactive Zero-Knowledge Proofs to\u00a0Multiple Verifiers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7453-4043","authenticated-orcid":false,"given":"Kang","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5991-7417","authenticated-orcid":false,"given":"Xiao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Abe, M.: Robust distributed multiplication without interaction. In: Advances in Cryptology-Crypto 1999. LNCS, vol. 1666, pp. 130\u2013147. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_9","DOI":"10.1007\/3-540-48405-1_9"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Abe, M., Cramer, R., Fehr, S.: Non-interactive distributed-verifier proofs and proving relations among commitments. In: Advances in Cryptology-Asiacrypt 2002. LNCS, pp. 206\u2013223. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_13","DOI":"10.1007\/3-540-36178-2_13"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: ACM Conference on Computer and Communications Security (CCS) 2017, pp. 2087\u20132104. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Kachlon, E., Patra, A.: Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority. Cryptology ePrint Archive, Paper 2022\/167 (2022). https:\/\/eprint.iacr.org\/2022\/167","DOI":"10.1007\/978-3-031-15985-5_2"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Baldimtsi, F., Kiayias, A., Zacharias, T., Zhang, B.: Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation. In: Advances in Cryptology-Asiacrypt 2020, Part III. LNCS, pp. 717\u2013748. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_24","DOI":"10.1007\/978-3-030-64840-4_24"},{"key":"18_CR6","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: ACM Conference on Computer and Communications Security (CCS) 2021, pp. 192\u2013211. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484812","DOI":"10.1145\/3460120.3484812"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Baum, C., Jadoul, R., Orsini, E., Scholl, P., Smart, N.P.: Feta: efficient threshold designated-verifier zero-knowledge proofs. Cryptology ePrint Archive, Paper 2022\/082 (2022). https:\/\/eprint.iacr.org\/2022\/082","DOI":"10.1145\/3548606.3559354"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-84259-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime }n^{\\prime }Cheese$$: zero-knowledge proofs for\u00a0Boolean and arithmetic circuits with\u00a0nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Beck, G., Goel, A., Jain, A., Kaptchuk, G.: Order-C secure multiparty computation for highly repetitive circuits. In: Advances in Cryptology-Eurocrypt 2021, Part II. LNCS, pp. 663\u2013693. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_23","DOI":"10.1007\/978-3-030-77886-6_23"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Advances in Cryptology-Crypto 2019, Part III. LNCS, vol. 11694, pp. 701\u2013732. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Advances in Cryptology-Eurocrypt 2019, Part I. LNCS, vol. 11476, pp. 103\u2013128. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: 9th Theory of Cryptography Conference\u2013TCC 2016, pp. 31\u201360. LNCS, Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Bhadauria, R., Fang, Z., Hazay, C., Venkitasubramaniam, M., Xie, T., Zhang, Y.: Ligero++: a new optimized sublinear IOP. In: ACM Conference on Computer and Communications Security (CCS) 2020, pp. 2025\u20132038. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3417893","DOI":"10.1145\/3372297.3417893"},{"key":"18_CR14","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: Advances in Cryptology-Crypto 2019, Part III. 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":"18_CR15","doi-asserted-by":"publisher","unstructured":"Bootle, J., Cerulli, A., Chaidos, P., Groth, J., Petit, C.: Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In: Advances in Cryptology-Eurocrypt 2016, Part II. LNCS, vol. 9666, pp. 327\u2013357. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_12","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Efficient fully secure computation via distributed zero-knowledge proofs. In: Advances in Cryptology-Asiacrypt 2020, Part III. LNCS, pp. 244\u2013276. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_9","DOI":"10.1007\/978-3-030-64840-4_9"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: IEEE Symposium Security and Privacy 2018, pp. 315\u2013334. IEEE (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Advances in Cryptology-Eurocrypt 2020, Part I. LNCS, vol. 12105, pp. 677\u2013706. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Burmester, M., Desmedt, Y.: Broadcast interactive proofs (extended abstract). In: Advances in Cryptology-Eurocrypt 1991. LNCS, pp. 81\u201395. Springer (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_7","DOI":"10.1007\/3-540-46416-6_7"},{"key":"18_CR20","doi-asserted-by":"publisher","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: 51th Annual ACM Symposium on Theory of Computing (STOC), pp. 1082\u20131090. ACM Press (2019). https:\/\/doi.org\/10.1145\/3313276.3316380","DOI":"10.1145\/3313276.3316380"},{"key":"18_CR21","unstructured":"Canetti, R., Kaptchuk, G.: The Broken Promise of Apple\u2019s Announced Forbidden-photo Reporting System - And How To Fix It. https:\/\/www.bu.edu\/riscs\/2021\/08\/10\/apple-csam\/ (2021)"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Chida, K., et al.: Fast large-scale honest-majority MPC for malicious adversaries. In: Advances in Cryptology-Crypto 2018, Part III. LNCS, vol. 10993, pp. 34\u201364. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_2","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"18_CR23","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: private, robust, and scalable computation of aggregate statistics. In: 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17), pp. 259\u2013282. USENIX Association, March 2017"},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Advances in Cryptology-Eurocrypt 2010. LNCS, pp. 445\u2013465. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"18_CR25","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Advances in Cryptology-Crypto 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Nielsen, J.B., Nielsen, M., Ranellucci, S.: The TinyTable Protocol for 2-party secure computation, or: gate-scrambling revisited. In: Advances in Cryptology-Crypto 2017, Part I. LNCS, vol. 10401, pp. 167\u2013187. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_6","DOI":"10.1007\/978-3-319-63688-7_6"},{"key":"18_CR27","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. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. ACM Press (2022)","DOI":"10.1145\/3548606.3559385"},{"key":"18_CR28","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: 2nd Conference on Information-Theoretic Cryptography (2021)"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Advances in Cryptology-Crypto 1986. LNCS, pp. 186\u2013194. Springer (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"18_CR30","doi-asserted-by":"publisher","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th Annual ACM Symposium on Theory of Computing (STOC), pp. 699\u2013710. ACM Press (1992). https:\/\/doi.org\/10.1145\/129712.129780","DOI":"10.1145\/129712.129780"},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Garay, J.A., Ishai, Y., Ostrovsky, R., Zikas, V.: The price of low communication in secure multi-party computation. In: Advances in Cryptology-Crypto 2017, Part I. LNCS, vol. 10401, pp. 420\u2013446. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_14","DOI":"10.1007\/978-3-319-63688-7_14"},{"key":"18_CR32","doi-asserted-by":"publisher","unstructured":"Genkin, D., Ishai, Y., Polychroniadou, A.: Efficient multi-party computation: from passive to active security via secure SIMD circuits. In: Advances in Cryptology-Crypto 2015, Part II. LNCS, vol. 9216, pp. 721\u2013741. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_35","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"18_CR33","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: 46th Annual ACM Symposium on Theory of Computing (STOC), pp. 495\u2013504. ACM Press (2014). https:\/\/doi.org\/10.1145\/2591796.2591861","DOI":"10.1145\/2591796.2591861"},{"key":"18_CR34","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Advances in Cryptology-Eurocrypt 2013. LNCS, pp. 626\u2013645. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"18_CR35","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 113\u2013122. ACM Press (2008). https:\/\/doi.org\/10.1145\/1374376.1374396","DOI":"10.1145\/1374376.1374396"},{"issue":"3","key":"18_CR36","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S Goldwasser","year":"2005","unstructured":"Goldwasser, S., Lindell, Y.: Secure multi-party computation without agreement. J. Cryptol. 18(3), 247\u2013287 (2005). https:\/\/doi.org\/10.1007\/s00145-005-0319-z","journal-title":"J. Cryptol."},{"key":"18_CR37","doi-asserted-by":"publisher","unstructured":"Gordon, S.D., Starin, D., Yerukhimovich, A.: The more the merrier: reducing the cost of large scale MPC. In: Advances in Cryptology-Eurocrypt 2021, Part II. LNCS, pp. 694\u2013723. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_24","DOI":"10.1007\/978-3-030-77886-6_24"},{"key":"18_CR38","doi-asserted-by":"publisher","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in the honest majority setting. In: Advances in Cryptology-Crypto 2021, Part II. LNCS, pp. 244\u2013274. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9","DOI":"10.1007\/978-3-030-84245-1_9"},{"key":"18_CR39","doi-asserted-by":"publisher","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Unconditional communication-efficient MPC via Hall\u2019s marriage theorem. In: Advances in Cryptology-Crypto 2021, Part II. LNCS, pp. 275\u2013304. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_10","DOI":"10.1007\/978-3-030-84245-1_10"},{"key":"18_CR40","unstructured":"Goyal, V., Song, Y.: Malicious Security Comes Free in Honest-Majority MPC. Cryptology ePrint Archive, Report 2020\/134 (2020). https:\/\/eprint.iacr.org\/2020\/134"},{"key":"18_CR41","doi-asserted-by":"publisher","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: Advances in Cryptology-Crypto 2020, Part II. LNCS, pp. 618\u2013646. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"18_CR42","doi-asserted-by":"publisher","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: Advances in Cryptology-Asiacrypt 2010. LNCS, pp. 321\u2013340. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_19","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"18_CR43","doi-asserted-by":"publisher","unstructured":"Groth, J., Ostrovsky, R.: Cryptography in the multi-string model. In: Advances in Cryptology-Crypto 2007. LNCS, vol. 4622, pp. 323\u2013341. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_18","DOI":"10.1007\/978-3-540-74143-5_18"},{"key":"18_CR44","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 21\u201330. ACM Press (2007). https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"18_CR45","doi-asserted-by":"publisher","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Fair-zero knowledge. In: Theory of Cryptography Conference\u2013TCC 2005. LNCS, vol. 3378, pp. 245\u2013263. Springer (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_14","DOI":"10.1007\/978-3-540-30576-7_14"},{"key":"18_CR46","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Nof, A.: A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority. In: ACM Conference on Computer and Communications Security (CCS) 2017, pp. 259\u2013276. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3133999","DOI":"10.1145\/3133956.3133999"},{"key":"18_CR47","doi-asserted-by":"publisher","unstructured":"Nordholt, P.S., Veeningen, M.: Minimising communication in honest-majority MPC by batchwise multiplication verification. In: International Conference on Applied Cryptography and Network Security (ACNS). LNCS, pp. 321\u2013339. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_17","DOI":"10.1007\/978-3-319-93387-0_17"},{"key":"18_CR48","doi-asserted-by":"publisher","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Advances in Cryptology-Crypto 2020, Part III. LNCS, pp. 704\u2013737. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"18_CR49","doi-asserted-by":"publisher","unstructured":"Wahby, R.S., Tzialla, I., shelat, a., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: IEEE Symposium Security and Privacy 2018, pp. 926\u2013943. IEEE (2018). https:\/\/doi.org\/10.1109\/SP.2018.00060","DOI":"10.1109\/SP.2018.00060"},{"key":"18_CR50","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: IEEE Symposium Security and Privacy 2021, pp. 1074\u20131091. IEEE (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"18_CR51","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: ACM Conference on Computer and Communications Security (CCS) 2021, pp. 2986\u20133001. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484556","DOI":"10.1145\/3460120.3484556"},{"key":"18_CR52","unstructured":"Yang, K., Wang, X.: Non-Interactive Zero-Knowledge Proofs to Multiple Verifiers. Cryptology ePrint Archive, Paper 2022\/063 (2022). https:\/\/eprint.iacr.org\/2022\/063"},{"key":"18_CR53","doi-asserted-by":"publisher","unstructured":"Zhang, J., et al.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: ACM Conference on Computer and Communications Security (CCS) 2021, pp. 159\u2013177. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484767","DOI":"10.1145\/3460120.3484767"},{"key":"18_CR54","doi-asserted-by":"publisher","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: IEEE Symposium Security and Privacy 2020, pp. 859\u2013876. IEEE (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00052","DOI":"10.1109\/SP40000.2020.00052"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22969-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:02:55Z","timestamp":1769216575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22969-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229688","9783031229695"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22969-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"364","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}