{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:47:04Z","timestamp":1755794824660,"version":"3.44.0"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019127","type":"print"},{"value":"9783032019134","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-032-01913-4_10","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:43Z","timestamp":1755332563000},"page":"319-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["$$\\textsf{OPA}$$: One-Shot Private Aggregation with\u00a0Single Client Interaction and\u00a0Its Applications to\u00a0Federated Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1787-4906","authenticated-orcid":false,"given":"Harish","family":"Karthikeyan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0125-2971","authenticated-orcid":false,"given":"Antigoni","family":"Polychroniadou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Addanki, S., Garbe, K., Jaffe, E., Ostrovsky, R., Polychroniadou, A.: Prio+: Privacy preserving aggregate statistics via Boolean shares. In: Galdi, C., Jarecki, S. (eds.) Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13409, pp. 516\u2013539. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_23","DOI":"10.1007\/978-3-031-14791-3_23"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 719\u2013737. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42","DOI":"10.1007\/978-3-642-29011-4_42"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Becker, D., Guajardo, J., Zimmermann, K.H.: Revisiting private stream aggregation: lattice-based PSA. In: NDSS\u00a02018. The Internet Society (2018). https:\/\/doi.org\/10.14722\/ndss.2018.23120","DOI":"10.14722\/ndss.2018.23120"},{"key":"10_CR4","unstructured":"Bell, J., Gasc\u00f3n, A., Lepoint, T., Li, B., Meiklejohn, S., Raykova, M., Yun, C.: ACORN: input validation for secure aggregation. In: 32nd USENIX Security Symposium (USENIX Security 23), pp. 4805\u20134822. USENIX Association, Anaheim, CA (2023). https:\/\/www.usenix.org\/conference\/usenixsecurity23\/presentation\/bell"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bell, J.H., Bonawitz, K.A., Gasc\u00f3n, A., Lepoint, T., Raykova, M.: Secure single-server aggregation with (poly) logarithmic overhead. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1253\u20131269 (2020)","DOI":"10.1145\/3372297.3417885"},{"key":"10_CR6","unstructured":"Bell-Clark, J., Gasc\u00f3n, A., Li, B., Raykova, M., Schoppmann, P.: Willow: secure aggregation with one-shot clients. In: Advances in Cryptology \u2013 CRYPTO 2025 (2025), to appear"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Benhamouda, F., Joye, M., Libert, B.: A new framework for privacy-preserving aggregation of time-series data. ACM Trans. Inf. Syst. Secur. 18(3) (2016). https:\/\/doi.org\/10.1145\/2873069","DOI":"10.1145\/2873069"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Bonawitz, K., et al.: Practical secure aggregation for privacy-preserving machine learning. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017, pp. 1175\u20131191. ACM (2017). https:\/\/doi.org\/10.1145\/3133956.3133982","DOI":"10.1145\/3133956.3133982"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lewi, K., Montgomery, H.W., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I. LNCS, vol.\u00a08042, pp. 410\u2013428. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_23","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Bouvier, C., Castagnos, G., Imbert, L., Laguillaumie, F.: I want to ride my BICYCL : BICYCL implements cryptography in class groups. J. Cryptol. 36(3), 17 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09459-1","DOI":"10.1007\/s00145-023-09459-1"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Braun, L., Damg\u00e5rd, I., Orlandi, C.: Secure multiparty computation from threshold encryption based on class groups. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0I. LNCS, vol. 14081, pp. 613\u2013645. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_20","DOI":"10.1007\/978-3-031-38557-5_20"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Brorsson, J., Gunnarsson, M.: Dipsauce: efficient private stream aggregation without trusted parties. To Appear in NordSec23 (2023)","DOI":"10.1007\/978-3-031-47748-5_12"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Byrd, D., Hybinette, M., Balch, T.H.: Abides: towards high-fidelity multi-agent market simulation. In: Proceedings of the 2020 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, pp. 11\u201322. SIGSIM-PADS \u201920, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3384441.3395986","DOI":"10.1145\/3384441.3395986"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: SCRAPE: scalable randomness attested by public entities. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 537\u2013556. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO. In: Joye, M., Leander, G. (eds.) EUROCRYPT\u00a02024, Part\u00a0V. LNCS, vol. 14655, pp. 216\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58740-5_8","DOI":"10.1007\/978-3-031-58740-5_8"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Kim, D., Kim, D., Lee, J., Shin, J., Song, Y.: Lattice-based secure biometric authentication for hamming distance. In: Baek, J., Ruj, S. (eds.) ACISP 21. LNCS, vol. 13083, pp. 653\u2013672. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90567-5_33","DOI":"10.1007\/978-3-030-90567-5_33"},{"key":"10_CR17","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: Private, robust, and scalable computation of aggregate statistics. In: Akella, A., Howell, J. (eds.) 14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017, Boston, MA, USA, March 27-29, 2017, pp. 259\u2013282. USENIX Association (2017). https:\/\/www.usenix.org\/conference\/nsdi17\/technical-sessions\/presentation\/corrigan-gibbs"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Linear integer secret sharing and distributed exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC\u00a02006. LNCS, vol.\u00a03958, pp. 75\u201390. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_6","DOI":"10.1007\/11745853_6"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"D\u00f6ttling, N., Kolonelos, D., Lai, R.W.F., Lin, C., Malavolta, G., Rahimi, A.: Efficient laconic cryptography from learning with errors. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0III. LNCS, vol. 14006, pp. 417\u2013446. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30620-4_14","DOI":"10.1007\/978-3-031-30620-4_14"},{"key":"10_CR20","unstructured":"Drand: Drand\/drand: a distributed randomness beacon daemon - go implementation. https:\/\/github.com\/drand\/drand"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Ernst, J., Koch, A.: Private stream aggregation with labels in the standard model. Proc. Priv. Enhancing Technol. 2021(4), 117\u2013138 (2021). https:\/\/doi.org\/10.2478\/popets-2021-0063, https:\/\/doi.org\/10.2478\/popets-2021-0063","DOI":"10.2478\/popets-2021-0063"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th ACM STOC, pp. 699\u2013710. ACM Press (1992). https:\/\/doi.org\/10.1145\/129712.129780","DOI":"10.1145\/129712.129780"},{"key":"10_CR23","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 - EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings. Lecture Notes in Computer Science, vol.\u00a08441, pp. 640\u2013658. Springer, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. 2. Basic Applications. Cambridge University Press, USA (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"10_CR25","unstructured":"Guo, Y., Polychroniadou, A., Shi, E., Byrd, D., Balch, T.: MicroFedML: privacy preserving federated learning for small weights. Cryptology ePrint Archive, Report 2022\/714 (2022). https:\/\/eprint.iacr.org\/2022\/714"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Guo, Y., Polychroniadou, A., Shi, E., Byrd, D., Balch, T.: MicroSecAgg: streamlined single-server secure aggregation. Proc. Priv. Enhancing Technol. 2024, 246\u2013275 (2024). https:\/\/doi.org\/10.56553\/popets-2024-0077","DOI":"10.56553\/popets-2024-0077"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Halevi, S., Lindell, Y., Pinkas, B.: Secure computation on the web: computing without simultaneous interaction. In: Rogaway, P. (ed.) Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings. Lecture Notes in Computer Science, vol.\u00a06841, pp. 132\u2013150. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_8","DOI":"10.1007\/978-3-642-22792-9_8"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Joye, M., Libert, B.: A scalable scheme for privacy-preserving aggregation of time-series data. In: Sadeghi, A.R. (ed.) FC 2013. LNCS, vol.\u00a07859, pp. 111\u2013125. Springer, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39884-1_10","DOI":"10.1007\/978-3-642-39884-1_10"},{"key":"10_CR29","unstructured":"Karthikeyan, H., Polychroniadou, A.: $$\\sf {OPA}$$: one-shot private aggregation with single client interaction and its applications to federated learning. Cryptology ePrint Archive, Report 2024\/723 (2024). https:\/\/eprint.iacr.org\/2024\/723"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Kim, D., Lee, D., Seo, J., Song, Y.: Toward practical lattice-based proof of knowledge from hint-MLWE. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO\u00a02023, Part\u00a0V. LNCS, vol. 14085, pp. 549\u2013580. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_18","DOI":"10.1007\/978-3-031-38554-4_18"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Leontiadis, I., Elkhiyaoui, K., Molva, R.: Private and dynamic time-series data aggregation with trust relaxation. In: Gritzalis, D., Kiayias, A., Askoxylakis, I.G. (eds.) CANS 14. LNCS, vol.\u00a08813, pp. 305\u2013320. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12280-9_20","DOI":"10.1007\/978-3-319-12280-9_20"},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"Li, H., Lin, H., Polychroniadou, A., Tessaro, S.: LERNA: secure single-server aggregation via key-homomorphic masking. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0I. LNCS, vol. 14438, pp. 302\u2013334. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8721-4_10","DOI":"10.1007\/978-981-99-8721-4_10"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Li, L., Xu, W., Chen, T., Giannakis, G.B., Ling, Q.: RSA: Byzantine-robust stochastic aggregation methods for distributed learning from heterogeneous datasets. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence. AAAI\u201919\/IAAI\u201919\/EAAI\u201919, AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33011544","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"10_CR34","doi-asserted-by":"publisher","unstructured":"Lindell, Y.: How to Simulate It \u2013 A Tutorial on the Simulation Proof Technique, pp. 277\u2013346. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57048-8_6","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"10_CR35","unstructured":"Liu, Z., Chen, S., Ye, J., Fan, J., Li, H., Li, X.: SASH: efficient secure aggregation based on SHPRG for federated learning. In: Cussens, J., Zhang, K. (eds.) Uncertainty in Artificial Intelligence, Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2022, 1-5 August 2022, Eindhoven, The Netherlands. Proceedings of Machine Learning Research, vol.\u00a0180, pp. 1243\u20131252. PMLR (2022). https:\/\/proceedings.mlr.press\/v180\/liu22c.html"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Nguyen, N.K., Plan\u00e7on, M.: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 71\u2013101. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_3","DOI":"10.1007\/978-3-031-15979-4_3"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT\u00a02010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_1","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"10_CR38","doi-asserted-by":"publisher","unstructured":"Ma, Y., Woods, J., Angel, S., Polychroniadou, A., Rabin, T.: Flamingo: multi-round single-server secure aggregation with applications to private federated learning. In: 2023 IEEE Symposium on Security and Privacy, pp. 477\u2013496. IEEE Computer Society Press (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179434","DOI":"10.1109\/SP46215.2023.10179434"},{"key":"10_CR39","unstructured":"McMahan, B., Moore, E., Ramage, D., Hampson, S., Arcas, B.A.Y.: Communication-efficient learning of deep networks from decentralized data. In: Singh, A., Zhu, J. (eds.) Proceedings of the 20th International Conference on Artificial Intelligence and Statistics. Proceedings of Machine Learning Research, vol.\u00a054, pp. 1273\u20131282. PMLR (2017). https:\/\/proceedings.mlr.press\/v54\/mcmahan17a.html"},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"Naor, M., Pinkas, B., Reingold, O.: Distributed pseudo-random functions and KDCs. In: Stern, J. (ed.) EUROCRYPT\u201999. LNCS, vol.\u00a01592, pp. 327\u2013346. Springer, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_23","DOI":"10.1007\/3-540-48910-X_23"},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-030-61078-4_5","volume-title":"Information and Communications Security","author":"H Okada","year":"2020","unstructured":"Okada, H., Takayasu, A., Fukushima, K., Kiyomoto, S., Takagi, T.: A compact digital signature scheme based on the module-LWR problem. In: Meng, W., Gollmann, D., Jensen, C.D., Zhou, J. (eds.) Information and Communications Security, pp. 73\u201390. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61078-4_5"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"Pasquini, D., Francati, D., Ateniese, G.: Eluding secure aggregation in federated learning via model inconsistency. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 2429\u20132443. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560557","DOI":"10.1145\/3548606.3560557"},{"key":"10_CR43","doi-asserted-by":"publisher","unstructured":"Rathee, M., Shen, C., Wagh, S., Popa, R.A.: ELSA: secure aggregation for federated learning with malicious actors. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 1961\u20131979 (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179468","DOI":"10.1109\/SP46215.2023.10179468"},{"key":"10_CR44","unstructured":"Reddi, S.J., et al.: Adaptive federated optimization. In: International Conference on Learning Representations (2021). https:\/\/openreview.net\/forum?id=LkFG3lB13U5"},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"issue":"11","key":"10_CR46","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. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"10_CR47","unstructured":"Shi, E., Chan, T.H.H., Rieffel, E.G., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: NDSS\u00a02011. The Internet Society (2011)"},{"key":"10_CR48","doi-asserted-by":"crossref","unstructured":"Shokri, R., Stronati, M., Song, C., Shmatikov, V.: Membership inference attacks against machine learning models. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 3\u201318. IEEE (2017)","DOI":"10.1109\/SP.2017.41"},{"key":"10_CR49","doi-asserted-by":"publisher","unstructured":"Takeshita, J., Carmichael, Z., Karl, R., Jung, T.: TERSE: tiny encryptions and really speedy execution for post-quantum private stream aggregation. In: Li, F., Liang, K., Lin, Z., Katsikas, S.K. (eds.) Security and Privacy in Communication Networks - 18th EAI International Conference, SecureComm 2022, Virtual Event, October 2022, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol.\u00a0462, pp. 331\u2013352. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-25538-0_18","DOI":"10.1007\/978-3-031-25538-0_18"},{"issue":"2","key":"10_CR50","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/s00145-023-09450-w","volume":"36","author":"J Takeshita","year":"2023","unstructured":"Takeshita, J., Karl, R., Gong, T., Jung, T.: SLAP: simpler, improved private stream aggregation from ring learning with errors. J. Cryptol. 36(2), 8 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09450-w","journal-title":"J. Cryptol."},{"key":"10_CR51","unstructured":"Waldner, H., Marc, T., Stopar, M., Abdalla, M.: Private stream aggregation from labeled secret sharing schemes. Cryptology ePrint Archive, Report 2021\/081 (2021). https:\/\/eprint.iacr.org\/2021\/081"},{"key":"10_CR52","unstructured":"Zhao, Y., Zhou, H., Wan, Z.: SuperFL: privacy-preserving federated learning with efficiency and robustness. Cryptology ePrint Archive, Report 2024\/081 (2024). https:\/\/eprint.iacr.org\/2024\/081"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01913-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T08:22:50Z","timestamp":1755332570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01913-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019127","9783032019134"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01913-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This paper was prepared for informational purposes by the Artificial Intelligence Research group of JPMorgan Chase & Co and its affiliates (\u201cJ.P. Morgan\u201d) and is not a product of the Research Department of J.P. Morgan. J.P. Morgan makes no representation and warranty whatsoever and disclaims all liability, for the completeness, accuracy or reliability of the information contained herein. This document is not intended as investment research or investment advice, or a recommendation, offer or solicitation for the purchase or sale of any security, financial instrument, financial product or service, or to be used in any way for evaluating the merits of participating in any transaction, and shall not constitute a solicitation under any jurisdiction or to any person, if such solicitation under such jurisdiction or to such person would be unlawful.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclaimer"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}