{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T16:09:52Z","timestamp":1790352592490,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"vor","delay-in-days":7,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ERC","award":["852952"],"award-info":[{"award-number":["852952"]}]},{"name":"AFOSR","award":["FA9550-21-1-0046"],"award-info":[{"award-number":["FA9550-21-1-0046"]}]},{"name":"ERC grant NTSC","award":["742754"],"award-info":[{"award-number":["742754"]}]},{"name":"MOST","award":["8109282"],"award-info":[{"award-number":["8109282"]}]},{"name":"BSF grant","award":["2022370"],"award-info":[{"award-number":["2022370"]}]},{"name":"ISF","award":["2951\/20"],"award-info":[{"award-number":["2951\/20"]}]},{"name":"Microsoft Research PhD Fellowship"},{"name":"ISF grant","award":["2774\/20"],"award-info":[{"award-number":["2774\/20"]}]},{"name":"ISF-NSFC grant","award":["3127\/23"],"award-info":[{"award-number":["3127\/23"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690359","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"3023-3037","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Secure Sorting and Selection via Function Secret Sharing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7642-1341","authenticated-orcid":false,"given":"Amit","family":"Agarwal","sequence":"first","affiliation":[{"name":"University of Illinois Urbana-Champaign, Urbana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0360-8129","authenticated-orcid":false,"given":"Elette","family":"Boyle","sequence":"additional","affiliation":[{"name":"NTT Research & Reichman University, Sunnyvale, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8528-9768","authenticated-orcid":false,"given":"Nishanth","family":"Chandran","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7209-3494","authenticated-orcid":false,"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[{"name":"Ben Gurion University, Beersheba, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5255-350X","authenticated-orcid":false,"given":"Divya","family":"Gupta","sequence":"additional","affiliation":[{"name":"Microsoft Research, Bengaluru, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4096-6305","authenticated-orcid":false,"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4268-4681","authenticated-orcid":false,"given":"Mahimna","family":"Kelkar","sequence":"additional","affiliation":[{"name":"Cornell University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3183-9402","authenticated-orcid":false,"given":"Yiping","family":"Ma","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, Philadelphia, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Compressing Unit-Vector Correlations via Sparse Pseudorandom Generators","author":"Agarwal Amit","unstructured":"Amit Agarwal, Elette Boyle, Niv Gilboa, Yuval Ishai, Mahimna Kelkar, and Yiping Ma. 2024. Compressing Unit-Vector Correlations via Sparse Pseudorandom Generators. In CRYPTO. Springer, 346--383."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Mikl\u00f3s Ajtai J\u00e1nos Koml\u00f3s and Endre Szemer\u00e9di. 1983. An O(n log n) Sorting Network. In STOC. ACM 1--9.","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401028"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.57"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Toshinori Araki Jun Furukawa Kazuma Ohara Benny Pinkas Hanan Rosemarin and Hikaru Tsuchida. 2021. Secure graph analysis at scale. In CCS. 610--629.","DOI":"10.1145\/3460120.3484560"},{"key":"e_1_3_2_1_6_1","volume-title":"Bead--sort: A natural sorting algorithm. Technical Report. Department of Computer Science","author":"Arulanandham Joshua J.","year":"2002","unstructured":"Joshua J. Arulanandham, Cristian S Calude, and Michael Dinneen. 2002. Bead--sort: A natural sorting algorithm. Technical Report. Department of Computer Science, The University of Auckland, New Zealand."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Koki Hamada Dai Ikarashi Ryo Kikuchi Ariel Nof Benny Pinkas Katsumi Takahashi and Junichi Tomida. 2022. Efficient secure three-party sorting with applications to data analysis and heavy hitters. In CCS. 125--138.","DOI":"10.1145\/3548606.3560691"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900017"},{"key":"e_1_3_2_1_10_1","volume-title":"Semi-homomorphic Encryption and Multiparty Computation","author":"Bendlin Rikke","unstructured":"Rikke Bendlin, Ivan Damg\u00e5rd, Claudio Orlandi, and Sarah Zakarias. 2011. Semi-homomorphic Encryption and Multiparty Computation. In EUROCRYPT. Springer, 169--188."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11599-3_4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403003"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02761857"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Nishanth Chandran Niv Gilboa Divya Gupta Yuval Ishai Nishant Kumar and Mayank Rathee. 2021. Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. In EUROCRYPT. 871--900.","DOI":"10.1007\/978-3-030-77886-6_30"},{"key":"e_1_3_2_1_15_1","volume-title":"Efficient pseudorandom correlation generators: Silent OT extension and more","author":"Boyle Elette","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, and Peter Scholl. 2019. Efficient pseudorandom correlation generators: Silent OT extension and more. In CRYPTO. Springer, 489--518."},{"key":"e_1_3_2_1_16_1","volume-title":"Function secret sharing","author":"Boyle Elette","unstructured":"Elette Boyle, Niv Gilboa, and Yuval Ishai. 2015. Function secret sharing. In EUROCRYPT. Springer, 337--367."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function secret sharing: Improvements and extensions. In CCS. 1292--1303.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Mark Braverman Jieming Mao and S Matthew Weinberg. 2016. Parallel algorithms for select and partition with noisy comparisons. In STOC. 851--862.","DOI":"10.1145\/2897518.2897642"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings, Part I. Springer, 283--314","author":"Bunn Paul","year":"2022","unstructured":"Paul Bunn, Eyal Kushilevitz, and Rafail Ostrovsky. 2022. CNF-FSS and its applications. In Public-Key Cryptography--PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8--11, 2022, Proceedings, Part I. Springer, 283--314."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_21_1","volume-title":"Secret-shared shuffle","author":"Chase Melissa","unstructured":"Melissa Chase, Esha Ghosh, and Oxana Poburinnaya. 2020. Secret-shared shuffle. In ASIACRYPT. Springer, 342--372."},{"key":"e_1_3_2_1_22_1","volume-title":"Michael Nielsen, and Samuel Ranellucci.","author":"Damg\u00e5rd Ivan","year":"2017","unstructured":"Ivan Damg\u00e5rd, Jesper Buus Nielsen, Michael Nielsen, and Samuel Ranellucci. 2017. The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. In EUROCRYPT. 167--187."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--32009--5_38"},{"key":"e_1_3_2_1_24_1","volume-title":"Spooky Encryption and Its Applications","author":"Dodis Yevgeniy","unstructured":"Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, and Daniel Wichs. 2016. Spooky Encryption and Its Applications. In CRYPTO. Springer, 93--122."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Jack Doerner and Abhi Shelat. 2017. Scaling ORAM for secure computation. In CCS. 523--535.","DOI":"10.1145\/3133956.3133967"},{"key":"e_1_3_2_1_26_1","volume-title":"Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers","author":"Guo Chun","unstructured":"Chun Guo, Jonathan Katz, Xiao Wang, and Yu Yu. 2020. Efficient and Secure Multiparty Computation from Fixed-Key Block Ciphers. In IEEE SP. 825--841."},{"key":"e_1_3_2_1_27_1","volume-title":"Practically efficient multi-party sorting protocols from comparison sort algorithms","author":"Hamada Koki","unstructured":"Koki Hamada, Ryo Kikuchi, Dai Ikarashi, Koji Chida, and Katsumi Takahashi. 2013. Practically efficient multi-party sorting protocols from comparison sort algorithms. In ICISC. Springer, 202--216."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Sigurd Meldgaard Claudio Orlandi and Anat Paskin-Cherniavsky. 2013. On the Power of Correlated Randomness in Secure Computation. In TCC. 600--620.","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"e_1_3_2_1_29_1","volume-title":"Improved garbled circuit building blocks and applications to auctions and computing minima","author":"Kolesnikov Vladimir","unstructured":"Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. 2009. Improved garbled circuit building blocks and applications to auctions and computing minima. In CANS. Springer, 1--20."},{"key":"e_1_3_2_1_30_1","first-page":"24","article-title":"Ruffle: Rapid 3-party shuffle protocols","volume":"3","author":"Shriram A Pranav","year":"2023","unstructured":"A Pranav Shriram, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, and Somya Sangal. 2023. Ruffle: Rapid 3-party shuffle protocols. Proceedings on Privacy Enhancing Technologies, Vol. 3 (2023), 24--42.","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"e_1_3_2_1_31_1","volume-title":"GMW vs. Yao? Efficient secure two-party computation with low depth circuits","author":"Schneider Thomas","unstructured":"Thomas Schneider and Michael Zohner. 2013. GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In FC. Springer, 275--292."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204030"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In FOCS. 162--167.","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24316-5_17"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690359","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690359","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:06:45Z","timestamp":1755842805000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":34,"alternative-id":["10.1145\/3658644.3690359","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690359","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}