{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T13:01:17Z","timestamp":1784638877362,"version":"3.55.0"},"publisher-location":"Cham","reference-count":77,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032325594","type":"print"},{"value":"9783032325600","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T00:00:00Z","timestamp":1784678400000},"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":[[2027]]},"DOI":"10.1007\/978-3-032-32560-0_9","type":"book-chapter","created":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:04:58Z","timestamp":1784635498000},"page":"241-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["FlexProofs: A Vector Commitment with\u00a0Flexible Linear Time for\u00a0Computing All Proofs"],"prefix":"10.1007","author":[{"given":"Jing","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liang Feng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,22]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abbaszadeh, K., Pappas, C., Katz, J., Papadopoulos, D.: Zero-knowledge proofs of training for deep neural networks. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 4316\u20134330 (2024)","DOI":"10.1145\/3658644.3670316"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s00145-014-9196-7","volume":"29","author":"M Abe","year":"2016","unstructured":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., Ohkubo, M.: Structure-preserving signatures and commitments to group elements. J. Cryptol. 29(2), 363\u2013421 (2016)","journal-title":"J. Cryptol."},{"key":"9_CR3","first-page":"1365","volume":"2022","author":"D Balb\u00e1s","year":"2022","unstructured":"Balb\u00e1s, D., Catalano, D., Fiore, D., Lai, R.W.: Functional commitments for circuits from falsifiable assumptions. IACR Cryptol. ePrint Arch. 2022, 1365 (2022)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bekkerman, R., Bilenko, M., Langford, J.: Scaling Up Machine Learning: Parallel and Distributed Approaches. Cambridge University Press (2011)","DOI":"10.1017\/CBO9781139042918"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) Theory of Cryptography Conference, pp. 31\u201360. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Benabbas, S., Gennaro, R., Vahlis, Y.: Verifiable delegation of computation over large datasets. In: Rogaway, P. (eds.) Annual Cryptology Conference, pp. 111\u2013131. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_7","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"9_CR8","unstructured":"Biggio, B., Nelson, B., Laskov, P.: Poisoning attacks against support vector machines. arXiv preprint arXiv:1206.6389 (2012)"},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008)","journal-title":"J. Cryptol."},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: proof-carrying data from additive polynomial commitments. In: Malkin, T., Peikert, C. (eds.) Annual International Cryptology Conference, pp. 649\u2013680. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_23","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"9_CR11","unstructured":"Boneh, D., Nguyen, W., Ozdemir, A.: Efficient functional commitments: How to commit to a private function. Cryptology ePrint Archive (2021)"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for inner pairing products and applications. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021, pp. 65\u201397. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_3","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSnark: modular design and composition of succinct zero-knowledge proofs. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2075\u20132092 (2019)","DOI":"10.1145\/3319535.3339820"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Nitulescu, A., R\u00e0fols, C., Zacharakis, A., Zapico, A.: Linear-map vector commitments and their practical applications. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, pp. 189\u2013219. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_7","DOI":"10.1007\/978-3-031-22972-5_7"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Cao, X., Fang, M., Liu, J., Gong, N.Z.: FLTRUST: byzantine-robust federated learning via trust bootstrapping. arXiv preprint arXiv:2012.13995 (2020)","DOI":"10.14722\/ndss.2021.24434"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"de\u00a0Castro, L., Peikert, C.: Functional commitments for all functions, with transparent setup and from sis. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. pp. 287\u2013320. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_10","DOI":"10.1007\/978-3-031-30620-4_10"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D., Tucker, I.: Additive-homomorphic functional commitments and applications to homomorphic signatures. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, pp. 159\u2013188. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_6","DOI":"10.1007\/978-3-031-22972-5_6"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 499\u2013530. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"9_CR20","unstructured":"Chiesa, A., Forbes, M.A., Spooner, N.: A zero knowledge sumcheck and its applications. arXiv preprintarXiv:1704.02086 (2017)"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 383\u2013395. IEEE (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Chu, H., Fiore, D., Kolonelos, D., Schr\u00f6der, D.: Inner product functional commitments with constant-size public parameters and openings. In: Galdi, C., Jarecki, S. (eds.) SCN 2022, pp. 639\u2013662. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_28","DOI":"10.1007\/978-3-031-14791-3_28"},{"key":"9_CR23","unstructured":"CNBC: Amazon has been promoting its own products at the bottom of competitors\u2019 listings (2018). https:\/\/www.cnbc.com\/2018\/10\/02\/amazon-is-testing-a-new-feature-that-promotes-its-private-label-brands-inside-a-competitors-product-listing.html"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th Annual Symposium on Foundations of Computer Science (SFCS 1987), pp. 427\u2013438. IEEE (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Fiore, D., Fournet, C., Ghosh, E., Kohlweiss, M., Ohrimenko, O., Parno, B.: Hash first, argue later: adaptive verifiable computations on outsourced data. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 1304\u20131316 (2016)","DOI":"10.1145\/2976749.2978368"},{"key":"9_CR26","unstructured":"Fung, C., Yoon, C.J., Beschastnikh, I.: Mitigating sybils in federated learning poisoning. arXiv preprint arXiv:1808.04866 (2018)"},{"key":"9_CR27","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: Permutations over Lagrange-bases for Oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Reyzin, L., Wee, H., Zhang, Z.: PointProofs: aggregating proofs for multiple vector commitments. In: CCS 2020, pp. 2007\u20132023 (2020)","DOI":"10.1145\/3372297.3417244"},{"key":"9_CR29","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for $$\\{$$Zero-Knowledge$$\\}$$ proof systems. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 519\u2013535 (2021)"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, JS. (eds.) Annual International Conference on the Theory and Applications of Cryptographic Techniques, 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":"9_CR31","unstructured":"Grubbs, P., Arun, A., Zhang, Y., Bonneau, J., Walfish, M.: $$\\{$$Zero-Knowledge$$\\}$$ middleboxes. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 4255\u20134272 (2022)"},{"issue":"6","key":"9_CR32","first-page":"176","volume":"14","author":"J Howe","year":"2006","unstructured":"Howe, J., et al.: The rise of crowdsourcing. Wired Mag. 14(6), 176\u2013183 (2006)","journal-title":"Wired Mag."},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Hu, R., Guo, Y., Pan, M., Gong, Y.: Targeted poisoning attacks on social recommender systems. In: 2019 IEEE Global Communications Conference (GLOBECOM), pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/GLOBECOM38437.2019.9013539"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Kasyap, H., Tripathy, S.: Hidden vulnerabilities in cosine similarity based poisoning defense. In: 2022 56th Annual Conference on Information Sciences and Systems (CISS), pp. 263\u2013268. IEEE (2022)","DOI":"10.1109\/CISS53076.2022.9751167"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"9_CR37","unstructured":"Kone\u010dn\u1ef3, J., McMahan, H.B., Yu, F.X., Richt\u00e1rik, P., Suresh, A.T., Bacon, D.: Federated learning: strategies for improving communication efficiency. arXiv preprint arXiv:1610.05492 (2016)"},{"key":"9_CR38","doi-asserted-by":"crossref","unstructured":"Kourtellis, N., Katevas, K., Perino, D.: FLAAS: federated learning as a service. In: Proceedings of the 1st Workshop on Distributed Machine Learning, pp. 7\u201313 (2020)","DOI":"10.1145\/3426745.3431337"},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-26948-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"RWF Lai","year":"2019","unstructured":"Lai, R.W.F., Malavolta, G.: Subvector commitments with application to succinct arguments. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 530\u2013560. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_19"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Lee, J.: Dory: Efficient, transparent arguments for generalised inner products and polynomial commitments. In: Nissim, K., Waters, B. (eds.) Theory of Cryptography Conference, pp. 1\u201334. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_1","DOI":"10.1007\/978-3-030-90453-1_1"},{"key":"9_CR41","unstructured":"Libert, B., Ramanna, S.C., Yung, M.: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions. In: ICALP 2016 (2016)"},{"key":"9_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-642-11799-2_30","volume-title":"Theory of Cryptography","author":"B Libert","year":"2010","unstructured":"Libert, B., Yung, M.: Concise mercurial vector commitments and independent zero-knowledge sets with short proofs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 499\u2013517. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_30"},{"key":"9_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-030-64840-4_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"H Lipmaa","year":"2020","unstructured":"Lipmaa, H., Pavlyk, K.: Succinct functional commitment for a large class of arithmetic circuits. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 686\u2013716. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_23"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Liu, J., Zhang, L.F.: Matproofs: maintainable matrix commitment with efficient aggregation. In: CCS 2022, pp. 2041\u20132054 (2022)","DOI":"10.1145\/3548606.3560591"},{"key":"9_CR45","doi-asserted-by":"crossref","unstructured":"Liu, T., Xie, T., Zhang, J., Song, D., Zhang, Y.: Pianist: Scalable ZKROLLUPS via fully distributed zero-knowledge proofs. In: 2024 IEEE Symposium on Security and Privacy (SP), pp. 1777\u20131793. IEEE (2024)","DOI":"10.1109\/SP54263.2024.00035"},{"key":"9_CR46","doi-asserted-by":"crossref","unstructured":"Liu, T., Xie, X., Zhang, Y.: ZKCNN: zero knowledge proofs for convolutional neural network predictions and accuracy. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2968\u20132985 (2021)","DOI":"10.1145\/3460120.3485379"},{"key":"9_CR47","unstructured":"Liu, X., Yang, X., Wang, Y., Zhang, X., Yang, X.: Evaluate and guard the wisdom of crowds: zero knowledge proofs for crowdsourcing truth inference. arXiv preprint arXiv:2308.00985 (2023)"},{"key":"9_CR48","doi-asserted-by":"crossref","unstructured":"Luo, G., Fu, S., Gong, G.: Updatable linear map commitments and their applications in elementary databases. In: PST 2021, pp. 1\u20136. IEEE (2021)","DOI":"10.1109\/PST52912.2021.9647740"},{"key":"9_CR49","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/TIFS.2022.3169918","volume":"17","author":"Z Ma","year":"2022","unstructured":"Ma, Z., Ma, J., Miao, Y., Li, Y., Deng, R.H.: SHIELDFL: mitigating model poisoning attacks in privacy-preserving federated learning. IEEE Trans. Inf. Forensics Secur. 17, 1639\u20131654 (2022)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"9_CR50","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., y\u00a0Arcas, B.A.: Communication-efficient learning of deep networks from decentralized data. In: Artificial Intelligence and Statistics, pp. 1273\u20131282. PMLR (2017)"},{"key":"9_CR51","doi-asserted-by":"publisher","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (eds.) CRYPTO 1987, pp. 369\u2013378. Springer (1987). https:\/\/doi.org\/10.1007\/3-540-48184-2_32","DOI":"10.1007\/3-540-48184-2_32"},{"key":"9_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-36594-2_13","volume-title":"Theory of Cryptography","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222\u2013242. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_13"},{"key":"9_CR53","doi-asserted-by":"publisher","unstructured":"Papamanthou, C., Shi, E., Tamassia, R., Yi, K.: Streaming authenticated data structures. In: Johansson, T., Nguyen, P.Q. (eds.) Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 353\u2013370. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_22","DOI":"10.1007\/978-3-642-38348-9_22"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Pappas, C., Papadopoulos, D., Papamanthou, C.: HydraProofs: optimally computing all proofs in a vector commitment (with applications to efficient ZKSNARKS over data from multiple users). In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 3421\u20133439. IEEE (2025)","DOI":"10.1109\/SP61157.2025.00204"},{"key":"9_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-90456-2_16","volume-title":"Theory of Cryptography","author":"C Peikert","year":"2021","unstructured":"Peikert, C., Pepin, Z., Sharp, C.: Vector and functional commitments from lattices. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13044, pp. 480\u2013511. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90456-2_16"},{"key":"9_CR56","doi-asserted-by":"crossref","unstructured":"Sasson, E.B., et al.: ZeroCash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"9_CR57","doi-asserted-by":"publisher","unstructured":"Schafer, J.B., Frankowski, D., Herlocker, J., Sen, S.: Collaborative filtering recommender systems. In: The adaptive web: methods and strategies of web personalization, pp. 291\u2013324. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-72079-9_9","DOI":"10.1007\/978-3-540-72079-9_9"},{"issue":"4","key":"9_CR58","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. J. ACM 27(4), 701\u2013717 (1980)","journal-title":"J. ACM"},{"key":"9_CR59","doi-asserted-by":"publisher","unstructured":"Setty, S.: Spartan: Efficient and general-purpose ZKSNARKS without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) Annual International Cryptology Conference, 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":"9_CR60","doi-asserted-by":"crossref","unstructured":"Sha, J., Liu, S., Han, S.: Functional commitments for arbitrary circuits of bounded sizes. In: Designs, Codes and Cryptography, pp. 1\u201335 (2024)","DOI":"10.1007\/s10623-024-01468-w"},{"issue":"11","key":"9_CR61","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"9_CR62","unstructured":"Srinivasan, S., Chepurnoy, A., Papamanthou, C., Tomescu, A., Zhang, Y.: Hyperproofs: aggregating and maintaining proofs in vector commitments. In: USENIX Security 22, pp. 3001\u20133018 (2022)"},{"key":"9_CR63","doi-asserted-by":"crossref","unstructured":"Tan, B., Liu, B., Zheng, V., Yang, Q.: A federated recommender system for online services. In: Proceedings of the 14th ACM Conference on Recommender Systems, pp. 579\u2013581 (2020)","DOI":"10.1145\/3383313.3411528"},{"key":"9_CR64","unstructured":"The guardian: revealed: the Facebook loophole that lets world leaders deceive and harass their citizens (2021). https:\/\/www.theguardian.com\/technology\/2021\/apr\/12\/facebook-loophole-state-backed-manipulation"},{"key":"9_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-57990-6_3","volume-title":"Security and Cryptography for Networks","author":"A Tomescu","year":"2020","unstructured":"Tomescu, A., Abraham, I., Buterin, V., Drake, J., Feist, D., Khovratovich, D.: Aggregatable Subvector commitments for stateless cryptocurrencies. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 45\u201364. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_3"},{"key":"9_CR66","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient ZKSNARKS without trusted setup. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 926\u2013943. IEEE (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"9_CR67","unstructured":"Wang, W., Ulichney, A., Papamanthou, C.: $$\\{$$BalanceProofs$$\\}$$: maintainable vector commitments with fast aggregation. In: USENIX Security 23, pp. 4409\u20134426 (2023)"},{"key":"9_CR68","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: Fast verification and cryptanalysis. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, pp. 201\u2013235. Springer (2023). https:\/\/doi.org\/10.1007\/978-981-99-8733-7_7","DOI":"10.1007\/978-981-99-8733-7_7"},{"key":"9_CR69","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct vector, polynomial, and functional commitments from lattices. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, pp. 385\u2013416. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_13","DOI":"10.1007\/978-3-031-30620-4_13"},{"key":"9_CR70","doi-asserted-by":"publisher","unstructured":"Wee, H., Wu, D.J.: Succinct functional commitments for circuits from k-lin. In: Joye, M., Leander, G. (eds.) EUROCRYPT 2024, pp. 280\u2013310. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_10","DOI":"10.1007\/978-3-031-58723-8_10"},{"key":"9_CR71","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.) Annual International Cryptology Conference, 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":"9_CR72","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/TIFS.2019.2929409","volume":"15","author":"G Xu","year":"2019","unstructured":"Xu, G., Li, H., Liu, S., Yang, K., Lin, X.: VerifyNet: secure and verifiable federated learning. IEEE Trans. Inf. Forensics Secur. 15, 911\u2013926 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"9_CR73","doi-asserted-by":"publisher","unstructured":"Yang, L., Tan, B., Zheng, V.W., Chen, K., Yang, Q.: Federated recommendation systems. In: Yang, Q., Fan, L., Yu, H. (eds.) Federated Learning: Privacy and Incentive, pp. 225\u2013239. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-63076-8_16","DOI":"10.1007\/978-3-030-63076-8_16"},{"key":"9_CR74","unstructured":"Zhang, J., Xie, T., Hoang, T., Shi, E., Zhang, Y.: Polynomial commitment with a $$\\{$$One-to-Many$$\\}$$ prover and applications. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 2965\u20132982 (2022)"},{"key":"9_CR75","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 859\u2013876. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00052"},{"key":"9_CR76","unstructured":"Zhang, Z., Li, W., Guo, Y., Shi, K., Chow, S.S., Liu, X., Dong, J.: Fast $$\\{$$RS-IOP$$\\}$$ multivariate polynomial commitments and verifiable secret sharing. In: 33rd USENIX Security Symposium (USENIX Security 24), pp. 3187\u20133204 (2024)"},{"key":"9_CR77","doi-asserted-by":"publisher","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (eds.) EUROSAM 1979, pp. 216\u2013226. Springer (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-32560-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T12:05:18Z","timestamp":1784635518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-32560-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,22]]},"ISBN":["9783032325594","9783032325600"],"references-count":77,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-32560-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,22]]},"assertion":[{"value":"22 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stony Brook, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/acns2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}