{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T00:17:24Z","timestamp":1761178644208,"version":"build-2065373602"},"reference-count":81,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T00:00:00Z","timestamp":1747267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFF0604702"],"award-info":[{"award-number":["2022YFF0604702"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371525"],"award-info":[{"award-number":["12371525"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,22]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, we consider a secure multi-party shuffling (MPS), in which multiple participants provide private datasets and enable to obtain secret shared values of randomly permuted whole dataset while protecting the privacy of each individual input and the permutation. MPS stands as a foundational tool for the randomized algorithm, with broad utility in a large amount of domains, offering enhancements in privacy while concurrently reducing costs. And its applications encompass machine learning, secure function evaluation, and anonymous communication. Recently, Chase, Ghosh, and Poburinnaya (2020 Secret-shared shuffle. Advances in Cryptology-ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part III 26, pp. 342-372. Springer.) introduced an innovative two-party protocol known as SSS, where participants can effectively produce additive secret shares of a shuffled dataset while preserving the privacy. Indeed, this approach transforms challenge of shuffling a dataset into the task of shuffling pseudorandom values, leading to a significant enhancement in both communication and computation efficiency. We would like to generalize the SSS in Chase, Ghosh, and Poburinnaya (2020 Secret-shared shuffle. Advances in Cryptology-ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7-11, 2020, Proceedings, Part III 26, pp. 342-372. Springer.) to a novel multi-party variant, all while maintaining its efficiency. However, it turns out that this is not straightforward. Specifically, the communication complexity is trivially blown up about $O(m^{3}n\\log n)$, where $m$ denotes the number of participants and $n$ denotes the length of message. We further reduce the cost to be linear in the number of participants. Moreover, our novel MPS operates within the preprocessing model, with the security against static semi-honest adversaries. Furthermore, our protocols rely exclusively on the oblivious transfer during the preprocessing phase and symmetric-key primitives in online phase to avoid the comparatively heavy public-key operations associated with previous MPS protocols.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf043","type":"journal-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T07:21:25Z","timestamp":1744183285000},"page":"1364-1376","source":"Crossref","is-referenced-by-count":0,"title":["Secure multi-party shuffling with optimal communication"],"prefix":"10.1093","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8183-7281","authenticated-orcid":false,"given":"Kai","family":"Chen","sequence":"first","affiliation":[{"name":"State Key Laboratory of Cyberspace Security Defense , Institute of Information Engineering, Chinese Academy of Sciences, Beijing,","place":["China"]},{"name":"School of Cyber Security , University of Chinese Academy of Sciences, Beijing,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8519-7214","authenticated-orcid":false,"given":"Bo","family":"Pang","sequence":"additional","affiliation":[{"name":"School of Cyber Security , University of Chinese Academy of Sciences, Beijing,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2551-2737","authenticated-orcid":false,"given":"Yongqiang","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cyberspace Security Defense , Institute of Information Engineering, Chinese Academy of Sciences, Beijing,","place":["China"]},{"name":"School of Cyber Security , University of Chinese Academy of Sciences, Beijing,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-0379-2343","authenticated-orcid":false,"given":"Mingsheng","family":"Wang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Cyberspace Security Defense , Institute of Information Engineering, Chinese Academy of Sciences, Beijing,","place":["China"]},{"name":"School of Cyber Security , University of Chinese Academy of Sciences, Beijing,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,5,15]]},"reference":[{"key":"2025102208423627500_ref1","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-64840-4_12","article-title":"Secret-shared shuffle","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, South Korea, December 7\u201311, 2020, Proceedings, Part III 26","author":"Chase","year":"2020"},{"volume-title":"Bristol Cryptography Blog","author":"Group, B","key":"2025102208423627500_ref2"},{"key":"2025102208423627500_ref3","first-page":"6435","article-title":"Squirrel: a scalable secure two-party computation framework for training gradient boosting decision tree","volume-title":"32nd USENIX Security Symposium (USENIX Security 23), Anaheim, CA","author":"Jie, Lu","year":"2023"},{"key":"2025102208423627500_ref4","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-30057-8_24","article-title":"Constant-round multi-party private set union using reversed Laurent series. Public key cryptography\u2013PKC 2012","volume-title":"15th International Conference on Practice and Theory in Public Key Cryptography, Darmstadt, Germany","author":"Seo","year":"2012"},{"key":"2025102208423627500_ref5","doi-asserted-by":"crossref","DOI":"10.14722\/ndss.2022.24141","article-title":"Clarion: anonymous communication from multiparty shuffling protocols","volume-title":"29th Annual Network and Distributed System Security Symposium, NDSS 2022, San Diego, California, USA","author":"Eskandarian","year":"2022"},{"key":"2025102208423627500_ref6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BFb0054144","article-title":"Universally verifiable mix-net with verification work independent of the number of mix-servers","volume":"1403","author":"Abe","year":"1998","journal-title":"Lect Notes Comput Sci"},{"key":"2025102208423627500_ref7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-70936-7_30","article-title":"How to shuffle in public. Theory of cryptography","volume-title":"4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands","author":"Adida","year":"2007"},{"key":"2025102208423627500_ref8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.48550\/arXiv.2002.05231","article-title":"Efficient cloud-based secret shuffling via homomorphic encryption","volume-title":"2020 IEEE Symposium on Computers and Communications (ISCC)","author":"Becher","year":"2020"},{"key":"2025102208423627500_ref9","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/1150402.1150415","article-title":"Efficient anonymity-preserving data collection","volume-title":"Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Brickell","year":"2006"},{"key":"2025102208423627500_ref10","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-76900-2_4","article-title":"A non-interactive shuffle with pairing based verifiability","volume-title":"Advances in Cryptology\u2013ASIACRYPT 2007: 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia","author":"Groth","year":"2007"},{"key":"2025102208423627500_ref11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11766155_29","article-title":"Filtering for private collaborative benchmarking. Emerging trends in information and communication security","volume-title":"International Conference, ETRICS 2006, Freiburg, Germany","author":"Kerschbaum","year":"2006"},{"key":"2025102208423627500_ref12","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-91859-0_4","article-title":"Efficient permutation protocol for MPC in the head. Security and trust management","volume-title":"17th International Workshop, STM 2021,, Darmstadt, Germany","author":"Laud","year":"2021"},{"key":"2025102208423627500_ref13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/501983.502000","article-title":"A verifiable secret shuffle and its application to e-voting","volume-title":"Proceedings of the 8th ACM conference on Computer and Communications Security","author":"Neff","year":"2001"},{"key":"2025102208423627500_ref14","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1145\/3319535.3363228","article-title":"Distributed vector-ole: improved constructions and implementation","volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","author":"Schoppmann","year":"2019"},{"key":"2025102208423627500_ref15","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1023\/A:1022491825047","article-title":"An overview of location-based services","volume":"21","author":"D\u2019Roza","year":"2003","journal-title":"BT Technol J"},{"key":"2025102208423627500_ref16","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/17489725.2018.1508763","article-title":"Location based services: ongoing evolution and research agenda","volume":"12","author":"Huang","year":"2018","journal-title":"J Locat Based Serv"},{"key":"2025102208423627500_ref17","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/1325555.1325568","article-title":"Location-based services","volume":"51","author":"Junglas","year":"2008","journal-title":"Commun ACM"},{"volume-title":"Location-Based Services","year":"2004","author":"Schiller","key":"2025102208423627500_ref18"},{"key":"2025102208423627500_ref19","doi-asserted-by":"publisher","first-page":"1889","DOI":"10.1109\/INFCOM.2011.5934991","article-title":"Applaus: a privacy-preserving location proof updating system for location-based services","volume-title":"2011 Proceedings IEEE INFOCOM","author":"Zhu","year":"2011"},{"key":"2025102208423627500_ref20","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/1242572.1242623","article-title":"PRIVE: anonymous location-based queries in distributed mobile systems","volume-title":"Proceedings of the 16th international conference on World Wide Web","author":"Ghinita","year":"2007"},{"key":"2025102208423627500_ref21","first-page":"763","article-title":"The new Casper: query processing for location services without compromising privacy","author":"Mokbel","year":"2006","journal-title":"VLDB"},{"key":"2025102208423627500_ref22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2634274.2634281","article-title":"Secure location sharing","volume-title":"Proceedings of the 10th ACM international workshop on Foundations of mobile computing","author":"Zamani","year":"2014"},{"key":"2025102208423627500_ref23","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","article-title":"Untraceable electronic mail, return addresses, and digital pseudonyms","volume":"24","author":"Chaum","year":"1981","journal-title":"Commun ACM"},{"key":"2025102208423627500_ref24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/SECPRI.2003.1199323","article-title":"Mixminion: design of a type iii anonymous remailer protocol","volume-title":"2003 Symposium on Security and Privacy","author":"Danezis","year":"2003"},{"key":"2025102208423627500_ref25","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/586110.586137","article-title":"Tarzan: a peer-to-peer anonymizing network layer","volume-title":"Proceedings of the 9th ACM conference on Computer and communications security","author":"Freedman","year":"2002"},{"key":"2025102208423627500_ref26","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1145\/3132747.3132783","article-title":"Stadium: a distributed metadata-private messaging system","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles","author":"Tyagi","year":"2017"},{"key":"2025102208423627500_ref27","doi-asserted-by":"publisher","first-page":"759","DOI":"10.48550\/arXiv.1901.04368","article-title":"XRD: scalable messaging system with cryptographic privacy","volume-title":"17th USENIX Symposium on Networked Systems Design and Implementation (NSDI 20), Santa Clara, CA","author":"Kwon","year":"2020"},{"key":"2025102208423627500_ref28","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1109\/TDSC.2018.2881452","article-title":"Privacy-preserving tensor decomposition over encrypted data in a federated cloud environment","volume":"17","author":"Feng","year":"2018","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2025102208423627500_ref29","doi-asserted-by":"crossref","first-page":"4904","DOI":"10.1109\/TII.2020.2968923","article-title":"Privacy-preserving tucker train decomposition over blockchain-based encrypted industrial iot data","volume":"17","author":"Feng","year":"2020","journal-title":"IEEE Trans Industr Inform"},{"key":"2025102208423627500_ref30","doi-asserted-by":"publisher","first-page":"638","DOI":"10.48550\/arXiv.1903.02837","article-title":"The privacy blanket of the shuffle model. Advances in cryptology\u2013CRYPTO 2019","volume-title":"39th Annual International Cryptology Conference, Santa Barbara, CA, USA","author":"Balle","year":"2019"},{"key":"2025102208423627500_ref31","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/3132747.3132769","article-title":"Prochlo: strong privacy for analytics in the crowd","volume-title":"Proceedings of the 26th symposium on operating systems principles","author":"Bittau","year":"2017"},{"key":"2025102208423627500_ref32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","article-title":"Differential privacy: a survey of results. Theory and applications of models of computation","volume-title":"5th International Conference, TAMC 2008, Xi\u2019an, China","author":"Dwork","year":"2008"},{"key":"2025102208423627500_ref33","first-page":"434","article-title":"The cocaine auction protocol: on the power of anonymous broadcast. Information hiding","volume-title":"Third International Workshop, IH\u201999, Dresden, Germany","author":"Stajano","year":"2000"},{"key":"2025102208423627500_ref34","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-319-61204-1_28","article-title":"cMix: mixing with minimal real-time asymmetric cryptographic operations","volume-title":"Applied Cryptography and Network Security: 15th International Conference, ACNS 2017, Kanazawa, Japan","author":"Chaum","year":"2017"},{"key":"2025102208423627500_ref35","doi-asserted-by":"publisher","first-page":"406","DOI":"10.48550\/arXiv.1612.07841","article-title":"Atom: horizontally scaling strong anonymity","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles","author":"Kwon","year":"2017"},{"key":"2025102208423627500_ref36","first-page":"711","article-title":"Karaoke: distributed private messaging immune to passive traffic analysis","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Lazar","year":"2018"},{"key":"2025102208423627500_ref37","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1145\/2829988.2787491","article-title":"Herd: a scalable, traffic analysis resistant anonymity network for VoIP systems","volume-title":"Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication","author":"Le Blond","year":"2015"},{"key":"2025102208423627500_ref38","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/2534169.2486002","article-title":"Towards efficient traffic-analysis resistant anonymity networks","volume":"43","author":"Le Blond","year":"2013","journal-title":"ACM SIGCOMM Comput Commun Rev"},{"key":"2025102208423627500_ref39","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2815400.2815417","article-title":"Vuvuzela: scalable private messaging resistant to traffic analysis","volume-title":"Proceedings of the 25th Symposium on Operating Systems Principles","author":"Van Den Hooff","year":"2015"},{"key":"2025102208423627500_ref40","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","article-title":"The dining cryptographers problem","volume":"1","author":"Chaum","year":"1988","journal-title":"J Cryptology"},{"key":"2025102208423627500_ref41","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BF00206326","article-title":"K-anonymous message transmission","volume-title":"Proceedings of the 10th ACM conference on Computer and Communications Security","author":"Von Ahn","year":"2003"},{"key":"2025102208423627500_ref42","first-page":"320","article-title":"Detection of disrupters in the dc protocol. Advances in cryptology\u2014EUROCRYPT\u201989","volume-title":"Workshop on the Theory and Application of Cryptographic Techniques Houthalen, Belgium","author":"Bos","year":"1990"},{"key":"2025102208423627500_ref43","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24676-3_27","article-title":"Dining cryptographers revisited. Advances in cryptology-EUROCRYPT 2004","volume-title":"International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland","author":"Golle","year":"2004"},{"key":"2025102208423627500_ref44","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-662-54970-4_23","article-title":"Footprint scheduling for dining-cryptographer networks. Financial cryptography and data security","volume-title":"20th International Conference, FC 2016, Christ Church, Barbados","author":"Krasnova","year":"2017"},{"key":"2025102208423627500_ref45","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-46885-4_32","article-title":"Unconditional sender and recipient untraceability in spite of active attacks. Advances in cryptology\u2014EUROCRYPT\u201989","volume-title":"Workshop on the Theory and Application of Cryptographic Techniques Houthalen, Belgium","author":"Waidner","year":"1990"},{"key":"2025102208423627500_ref46","article-title":"The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability","volume-title":"Advances in Cryptology\u2014EUROCRYPT","author":"Waidner","year":"1989"},{"key":"2025102208423627500_ref47","first-page":"179","article-title":"Dissent in numbers: making strong anonymity scale","volume-title":"10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)","author":"Wolinsky","year":"2012"},{"key":"2025102208423627500_ref48","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1145\/3372297.3417261","article-title":"Blinder\u2013scalable, robust anonymous committed broadcast","volume-title":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Abraham","year":"2020"},{"key":"2025102208423627500_ref49","first-page":"1217","article-title":"$\\Big \\{$MCMix$\\Big \\}$: anonymous messaging via secure multiparty computation","volume-title":"26th USENIX Security Symposium (USENIX Security 17)","author":"Alexopoulos","year":"2017"},{"key":"2025102208423627500_ref50","doi-asserted-by":"publisher","first-page":"181","DOI":"10.48550\/arXiv.1710.10237","article-title":"PriFi: a low-latency and tracking-resistant protocol for local-area anonymous communication","volume-title":"Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society","author":"Barman","year":"2016"},{"key":"2025102208423627500_ref51","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/SP.2015.27","article-title":"Riposte: an anonymous messaging system handling millions of users","volume-title":"2015 IEEE Symposium on Security and Privacy","author":"Corrigan-Gibbs","year":"2015"},{"key":"2025102208423627500_ref52","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1145\/3319535.3354238","article-title":"Honeybadgermpc and asynchromix: practical asynchronous MPC and its application to anonymous communication","volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","author":"Lu","year":"2019"},{"key":"2025102208423627500_ref53","doi-asserted-by":"publisher","first-page":"e176","DOI":"10.1002\/spy2.176","article-title":"Multiparty protocol that usually shuffles","volume":"4","author":"Mardi","year":"2021","journal-title":"Secur Privacy"},{"key":"2025102208423627500_ref54","doi-asserted-by":"publisher","first-page":"24","DOI":"10.56553\/popets-2023-0068","article-title":"Ruffle: rapid 3-party shuffle protocols","volume":"3","author":"Pranav Shriram","year":"2023","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"2025102208423627500_ref55","doi-asserted-by":"crossref","first-page":"347","DOI":"10.56553\/popets-2023-0057","article-title":"RPM: robust anonymity at scale","volume":"2023","author":"Lu","year":"2023","journal-title":"Proc Priv Enhancing Technol"},{"key":"2025102208423627500_ref56","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1145\/3460120.3484560","article-title":"Secure graph analysis at scale. Proceedings of the 2021 ACM SIGSAC","volume-title":"Conference on Computer and Communications Security","author":"Araki","year":"2021"},{"key":"2025102208423627500_ref57","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/SP.2015.30","article-title":"GraphSC: parallel secure computation made easy","volume-title":"2015 IEEE Symposium on Security and Privacy","author":"Nayak","year":"2015"},{"key":"2025102208423627500_ref58","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/233551.233553","article-title":"Software protection and simulation on oblivious rams","volume":"43","author":"Goldreich","year":"1996","journal-title":"J ACM"},{"key":"2025102208423627500_ref59","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24861-0_18","article-title":"Round-efficient oblivious database manipulation. Information security","volume-title":"14th International Conference, ISC 2011, Xi\u2019an, China","author":"Laur","year":"2011"},{"volume-title":"Sharemind: Programmable Secure Computations with Practical Applications","year":"2013","author":"Bogdanov","key":"2025102208423627500_ref60"},{"key":"2025102208423627500_ref61","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/CSF.2015.13","article-title":"Automatic proofs of privacy of secure multi-party computation protocols against active adversaries","volume-title":"2015 IEEE 28th Computer Security Foundations Symposium","author":"Pettai","year":"2015"},{"key":"2025102208423627500_ref62","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-319-25258-2_32","article-title":"Secure multi-party shuffling. Structural information and communication complexity","volume-title":"22nd International Colloquium, SIROCCO 2015, Montserrat, Spain","author":"Movahedi","year":"2015"},{"key":"2025102208423627500_ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484584","article-title":"Oblivious linear group actions and applications","volume-title":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security","author":"Attrapadung","year":"2021"},{"key":"2025102208423627500_ref64","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1250790.1250794","article-title":"Zero-knowledge from secure multiparty computation","author":"Ishai","year":"2007","journal-title":"Proceedings of the thirty-ninth annual ACM symposium on Theory of computing"},{"key":"2025102208423627500_ref65","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-030-92548-2_13","article-title":"Linear-time oblivious permutations for SPDZ. Cryptology and network security","volume-title":"20th International Conference, CANS 2021, Vienna, Austria","author":"Laud","year":"2021"},{"key":"2025102208423627500_ref66","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","article-title":"Practical covertly secure MPC for dishonest majority\u2013or: breaking the spdz limits. Computer security\u2013ESORICS 2013","volume-title":"18th European Symposium on Research in Computer Security, Egham, UK","author":"Damg\u00e5rd","year":"2013"},{"key":"2025102208423627500_ref67","doi-asserted-by":"publisher","first-page":"01","DOI":"10.14722\/ndss.2024.24021","author":"Song","year":"2024","journal-title":"Secret-shared shuffle with malicious security"},{"key":"2025102208423627500_ref68","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","article-title":"A general composition theorem for secure reactive systems","volume-title":"Theory of Cryptography: First Theory of Cryptography Conference, TCC 2004, Cambridge, MA, USA","author":"Backes","year":"2004"},{"key":"2025102208423627500_ref69","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/28395.28420","article-title":"How to play any mental game, or a completeness theorem for protocols with honest majority providing sound foundations for cryptography","volume-title":"Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali","author":"Goldreich","year":"2019"},{"volume-title":"How to Exchange Secrets by Oblivious Transfer","year":"1981","author":"Rabin","key":"2025102208423627500_ref70"},{"key":"2025102208423627500_ref71","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/73007.73012","article-title":"Limits on the provable consequences of one-way permutations","author":"Impagliazzo","year":"1989","journal-title":"Proceedings of the twenty-first annual ACM symposium on Theory of computing"},{"key":"2025102208423627500_ref72","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1145\/237814.237996","article-title":"Correlated pseudorandomness and the complexity of private computations","author":"Beaver","year":"1996","journal-title":"Proceedings of the twenty-eighth annual ACM symposium on Theory of computing"},{"key":"2025102208423627500_ref73","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9","article-title":"Extending oblivious transfers efficiently. Crypto, pp. 145\u2013161. Springer","author":"Ishai","year":"2003"},{"key":"2025102208423627500_ref74","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40084-1_4","article-title":"Improved OT extension for transferring short secrets. Advances in cryptology\u2013CRYPTO 2013","volume-title":"33rd Annual Cryptology Conference, Santa Barbara, CA, USA","author":"Kolesnikov","year":"2013"},{"key":"2025102208423627500_ref75","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1145\/2508859.2516738","article-title":"More efficient oblivious transfer and extensions for faster secure computation","volume-title":"Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security","author":"Asharov","year":"2013"},{"key":"2025102208423627500_ref76","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45539-6_10","article-title":"Single database private information retrieval implies oblivious transfer. Advances in cryptology\u2014EUROCRYPT 2000","volume-title":"International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium","author":"Di Crescenzo","year":"2000"},{"key":"2025102208423627500_ref77","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-47721-7_17","article-title":"All-or-nothing disclosure of secrets","volume-title":"Advances in Cryptology\u2014CRYPTO\u201986: Proceedings 6","author":"Brassard","year":"1987"},{"key":"2025102208423627500_ref78","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","article-title":"Oblivious transfer with adaptive queries","volume-title":"Crypto","author":"Naor","year":"1999"},{"key":"2025102208423627500_ref79","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","article-title":"A pseudorandom generator from any one-way function","volume":"28","author":"H\u00e5stad","year":"1999","journal-title":"SIAM J Comput"},{"key":"2025102208423627500_ref80","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/3319535.3354255","article-title":"Efficient two-round OT extension and silent non-interactive secure computation","volume-title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security","author":"Boyle","year":"2019"},{"key":"2025102208423627500_ref81","doi-asserted-by":"publisher","first-page":"011","DOI":"10.1109\/ICCKE50421.2020.9303630","article-title":"Secure multi-party sorting protocol based on distributed oblivious transfer","volume-title":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","author":"Dehghan","year":"2020"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/10\/1364\/63198916\/bxaf043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/68\/10\/1364\/63198916\/bxaf043.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T12:42:46Z","timestamp":1761136966000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/68\/10\/1364\/8133220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,15]]},"references-count":81,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,5,15]]},"published-print":{"date-parts":[[2025,10,22]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf043","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2025,10]]},"published":{"date-parts":[[2025,5,15]]}}}