{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T17:09:08Z","timestamp":1779469748235,"version":"3.53.1"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267337","type":"print"},{"value":"9783032267344","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-26734-4_11","type":"book-chapter","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T16:24:13Z","timestamp":1779467053000},"page":"321-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Secret-Shared Shuffle from\u00a0Authenticated Correlations"],"prefix":"10.1007","author":[{"given":"Xiangfu","family":"Song","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaojian","family":"Liang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ye","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianli","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pu","family":"Duan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changyu","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ee-Chien","family":"Chang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,23]]},"reference":[{"key":"11_CR1","unstructured":"Alexopoulos, N., Kiayias, A., Talviste, R., Zacharias, T.: MCMix: anonymous messaging via secure multiparty computation. In: USENIX Security Symposium, pp. 1217\u20131234 (2017)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Anderson, E., Chase, M., Durak, F.B., Laine, K., Weng, C.: Precio: private aggregate measurement via oblivious shuffling. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 1819\u20131833 (2024)","DOI":"10.1145\/3658644.3670280"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Araki, T., Furukawa, J., Ohara, K., Pinkas, B., Rosemarin, H., Tsuchida, H.: Secure graph analysis at scale. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 610\u2013629 (2021)","DOI":"10.1145\/3460120.3484560"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Asharov, G., et al.: Efficient secure three-party sorting with applications to data analysis and heavy hitters. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 125\u2013138 (2022)","DOI":"10.1145\/3548606.3560691"},{"key":"11_CR5","unstructured":"Asharov, G., Hamada, K., Kikuchi, R., Nof, A., Pinkas, B., Tomida, J.: Secure statistical analysis on multiple datasets: join and group-by. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 3298\u20133312 (2023)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Attrapadung, N., et al.: Oblivious linear group actions and applications. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 630\u2013650 (2021)","DOI":"10.1145\/3460120.3484584"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Balle, B., Bell, J., Gasc\u00f3n, A., Nissim, K.: Private summation in the multi-message shuffle model. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 657\u2013676 (2020)","DOI":"10.1145\/3372297.3417242"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-29011-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"S Bayer","year":"2012","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 263\u2013280. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1002\/j.1538-7305.1964.tb04103.x","volume":"43","author":"VE Bene\u0161","year":"1964","unstructured":"Bene\u0161, V.E.: Optimal rearrangeable multistage connecting networks. Bell Syst. Tech. J. 43(4), 1641\u20131656 (1964)","journal-title":"Bell Syst. Tech. J."},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-11599-3_4","volume-title":"Secure IT Systems","author":"D Bogdanov","year":"2014","unstructured":"Bogdanov, D., Laur, S., Talviste, R.: A practical analysis of oblivious sorting algorithms for secure multi-party computation. In: Bernsmed, K., Fischer-H\u00fcbner, S. (eds.) NordSec 2014. LNCS, vol. 8788, pp. 59\u201374. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11599-3_4"},{"key":"11_CR12","doi-asserted-by":"crossref","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 (SP), pp. 762\u2013776. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00048"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-64840-4_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Chase","year":"2020","unstructured":"Chase, M., Ghosh, E., Poburinnaya, O.: Secret-shared shuffle. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 342\u2013372. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_12"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-17653-2_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Cheu","year":"2019","unstructured":"Cheu, A., Smith, A., Ullman, J., Zeber, D., Zhilyaev, M.: Distributed differential privacy via shuffling. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 375\u2013403. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_13"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Cheu, A., Zhilyaev, M.: Differentially private histograms in the shuffle model from fake users. In: IEEE SP, pp. 440\u2013457 (2022)","DOI":"10.1109\/SP46214.2022.9833614"},{"key":"11_CR17","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: private, robust, and scalable computation of aggregate statistics. In: NSDI, pp. 259\u2013282 (2017)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-030-59013-0_32","volume-title":"Computer Security \u2013 ESORICS 2020","author":"A Dalskov","year":"2020","unstructured":"Dalskov, A., Orlandi, C., Keller, M., Shrishak, K., Shulman, H.: Securing DNSSEC keys via threshold ECDSA from generic MPC. In: Chen, L., Li, N., Liang, K., Schneider, S. (eds.) ESORICS 2020. LNCS, vol. 12309, pp. 654\u2013673. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59013-0_32"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-642-14623-7_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Orlandi, C.: Multiparty computation for dishonest majority: from passive to active security at low cost. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 558\u2013576. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_30"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Feldman, V., Mironov, I., Raghunathan, A., Talwar, K., Thakurta, A.: Amplification by shuffling: from local to central differential privacy via anonymity. In: Chan, T.M. (ed.) SODA, pp. 2468\u20132479 (2019)","DOI":"10.1137\/1.9781611975482.151"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Eskandarian, S., Boneh, D.: Clarion: anonymous communication from multiparty shuffling protocols. In: Network and Distributed System Security (NDSS) Symposium (2022)","DOI":"10.14722\/ndss.2022.24141"},{"key":"11_CR24","unstructured":"Gao, J., Zhang, Y., Zhong, S.: Multiparty shuffle: linear online phase is almost for free. Cryptology ePrint Archive (2024)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-030-75248-4_21","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"G Garimella","year":"2021","unstructured":"Garimella, G., Mohassel, P., Rosulek, M., Sadeghian, S., Singh, J.: Private set operations from oblivious switching. In: Garay, J.A. (ed.) PKC 2021. LNCS, vol. 12711, pp. 591\u2013617. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_21"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Gasc\u00f3n, A., Ishai, Y., Kelkar, M., Li, B., Ma, Y., Raykova, M.: Computationally secure aggregation and private information retrieval in the shuffle model. Cryptology ePrint Archive (2024)","DOI":"10.1145\/3658644.3670391"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M.M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 495\u2013504 (2014)","DOI":"10.1145\/2591796.2591861"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in cot and DPF. In Hazay, C., Stam, M. (eds) EUROCRYPT 2023. LNCS, vol. 14004, pp. 330\u2013362. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_12","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"11_CR29","unstructured":"Hamada, K., Ikarashi, D., Chida, K., Takahashi, K.: Oblivious radix sort: an efficient sorting algorithm for practical secure multi-party computation. Cryptology ePrint Archive (2014)"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-37682-5_15","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"K Hamada","year":"2013","unstructured":"Hamada, K., Kikuchi, R., Ikarashi, D., Chida, K., Takahashi, K.: Practically efficient multi-party sorting protocols from comparison sort algorithms. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 202\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_15"},{"key":"11_CR31","unstructured":"Han, F., et al.: Concretely efficient correlated oblivious permutation. Cryptology ePrint Archive (2025)"},{"key":"11_CR32","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"11_CR33","unstructured":"Jia, Y., Sun, S., Zhou, H.-S., Du, J., Gu, D.: Shuffle-based private set union: faster and more secure. In USENIX Security 2022, pp. 2947\u20132964 (2022)"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Keller, M.: MP-SPDZ: a versatile framework for multi-party computation. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1575\u20131590 (2020)","DOI":"10.1145\/3372297.3417872"},{"key":"11_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-662-47989-6_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Keller","year":"2015","unstructured":"Keller, M., Orsini, E., Scholl, P.: Actively secure OT extension with optimal overhead. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 724\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_35"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 830\u2013842 (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Koti, N., Kukkala, V.B., Patra, A., Gopal, B.R., Sangal, S., et\u00a0al.: Ruffle: rapid 3-party shuffle protocols. In: Proceedings on Privacy Enhancing Technologies (2023)","DOI":"10.56553\/popets-2023-0068"},{"key":"11_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-91859-0_4","volume-title":"Security and Trust Management","author":"P Laud","year":"2021","unstructured":"Laud, P.: Efficient permutation protocol for\u00a0MPC in\u00a0the\u00a0head. In: Roman, R., Zhou, J. (eds.) STM 2021. LNCS, vol. 13075, pp. 62\u201380. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91859-0_4"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-030-92548-2_13","volume-title":"Cryptology and Network Security","author":"P Laud","year":"2021","unstructured":"Laud, P.: Linear-time oblivious permutations for\u00a0SPDZ. In: Conti, M., Stevens, M., Krenn, S. (eds.) CANS 2021. LNCS, vol. 13099, pp. 245\u2013252. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92548-2_13"},{"key":"11_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24861-0_18","volume-title":"Information Security","author":"S Laur","year":"2011","unstructured":"Laur, S., Willemson, J., Zhang, B.: Round-efficient oblivious database manipulation. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 262\u2013277. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24861-0_18"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Le, T., Hoang, T.: MAPLE: a metadata-hiding policy-controllable encrypted search platform with minimal trust. Cryptology ePrint Archive (2023)","DOI":"10.56553\/popets-2023-0105"},{"issue":"2","key":"11_CR42","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/s00145-015-9198-0","volume":"29","author":"Y Lindell","year":"2016","unstructured":"Lindell, Y.: Fast cut-and-choose-based protocols for malicious and covert adversaries. J. Cryptol. 29(2), 456\u2013490 (2016)","journal-title":"J. Cryptol."},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Lu, D., Kate, A.: RPM: robust anonymity at scale. In: Proceedings on Privacy Enhancing Technologies (2023)","DOI":"10.56553\/popets-2023-0057"},{"key":"11_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-56877-1_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"P Miao","year":"2020","unstructured":"Miao, P., Patel, S., Raykova, M., Seth, K., Yung, M.: Two-sided malicious security for private intersection-sum with cardinality. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 3\u201333. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_1"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Rindal, P., Rosulek, M.: Fast database joins and psi for secret shared data. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1271\u20131287 (2020)","DOI":"10.1145\/3372297.3423358"},{"key":"11_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-38348-9_33","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"P Mohassel","year":"2013","unstructured":"Mohassel, P., Sadeghian, S.: How to hide circuits in MPC an efficient framework for private function evaluation. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 557\u2013574. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_33"},{"key":"11_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-662-45608-8_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"P Mohassel","year":"2014","unstructured":"Mohassel, P., Sadeghian, S., Smart, N.P.: Actively secure private function evaluation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 486\u2013505. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_26"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Nayak, K., Wang, X.S., Ioannidis, S., Weinsberg, U., Taft, N., Shi, E.: GraphSC: parallel secure computation made easy. In: 2015 IEEE Symposium on Security and Privacy, pp. 377\u2013394. IEEE (2015)","DOI":"10.1109\/SP.2015.30"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Neff, C.A.: A verifiable secret shuffle and its application to e-voting. In: Proceedings of the 8th ACM conference on Computer and Communications Security, pp. 116\u2013125 (2001)","DOI":"10.1145\/501983.502000"},{"key":"11_CR50","doi-asserted-by":"crossref","unstructured":"Peceny, S., Raghuraman, S., Rindal, P., Shah, H.: Efficient permutation correlations and batched random access for two-party computation. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-3-031-91829-2_3"},{"key":"11_CR51","doi-asserted-by":"crossref","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. IEEE (2023)","DOI":"10.1109\/SP46215.2023.10179468"},{"issue":"4","key":"11_CR52","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 (JACM) 27(4), 701\u2013717 (1980)","journal-title":"J. ACM (JACM)"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Song, X., Yin, D., Bai, J., Dong, C., Chang, E.-C.: Secret-shared shuffle with malicious security. In: Network and Distributed System Security (NDSS) Symposium (2024)","DOI":"10.14722\/ndss.2024.24021"},{"issue":"1","key":"11_CR54","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. J. ACM (JACM) 15(1), 159\u2013163 (1968)","journal-title":"J. ACM (JACM)"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Xu, S., Zheng, Y., Hua, Z.: Camel: communication-efficient and maliciously secure federated learning in the shuffle model of differential privacy. arXiv preprint arXiv:2410.03407 (2024)","DOI":"10.1145\/3658644.3690200"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Yang, Y., et al.: Maliciously secure circuit-psi via SPDZ-compatible oblivious PRF. Cryptology ePrint Archive (2024)","DOI":"10.56553\/popets-2025-0082"},{"key":"11_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"},{"key":"11_CR58","doi-asserted-by":"crossref","unstructured":"Zou, Z., Liu, Z., Shan,J., Li, Q., Xu, K., Xu, M.: CoGNN: towards secure and efficient collaborative graph learning. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 4032\u20134046 (2024)","DOI":"10.1145\/3658644.3670300"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26734-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T16:24:20Z","timestamp":1779467060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26734-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267337","9783032267344"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26734-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","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":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}