Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters-Reference-Cited by-同舟云学术

Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters

Published:2022-11-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Asharov Gilad¹,Hamada Koki²,Ikarashi Dai²,Kikuchi Ryo²,Nof Ariel³,Pinkas Benny¹,Takahashi Katsumi⁴,Tomida Junichi²

Affiliation:

1. Bar-Ilan University, Ramat Gan, Israel

2. NTT Corporation, Tokyo, Japan

3. Technion, Haifa, Israel

4. NTT Corporation, Ramat Gan, Japan

Funder

European Union?s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie grant agreement

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3548606.3560691

Reference38 articles.

1. Mark Abspoel , Anders P. K. Dalskov , Daniel Escudero , and Ariel Nof . 2021 . An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. In Applied Cryptography and Network Security - 19th International Conference , ACNS 2021, Kamakura, Japan, June 21--24, 2021, Proceedings, Part II (Lecture Notes in Computer Science), Kazue Sako and Nils Ole Tippenhauer (Eds.) , Vol. 12727 . Springer, 122--152. https://doi.org/10.1007/978-3-030-78375-4_6 10.1007/978-3-030-78375-4_6 Mark Abspoel, Anders P. K. Dalskov, Daniel Escudero, and Ariel Nof. 2021. An Efficient Passive-to-Active Compiler for Honest-Majority MPC over Rings. In Applied Cryptography and Network Security - 19th International Conference, ACNS 2021, Kamakura, Japan, June 21--24, 2021, Proceedings, Part II (Lecture Notes in Computer Science), Kazue Sako and Nils Ole Tippenhauer (Eds.), Vol. 12727. Springer, 122--152. https://doi.org/10.1007/978-3-030-78375-4_6

2. Miklós Ajtai János Komlós and Endre Szemerédi. 1983. An O(n log n) Sorting Network. In STOC. 1--9. https://doi.org/10.1145/800061.808726 10.1145/800061.808726

3. Miklós Ajtai János Komlós and Endre Szemerédi. 1983. An O(n log n) Sorting Network. In STOC. 1--9. https://doi.org/10.1145/800061.808726

4. Toshinori Araki Jun Furukawa Yehuda Lindell Ariel Nof and Kazuma Ohara. 2016. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. In CCS. 805--817. https://doi.org/10.1145/2976749.2978331 10.1145/2976749.2978331

5. Toshinori Araki Jun Furukawa Yehuda Lindell Ariel Nof and Kazuma Ohara. 2016. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority. In CCS. 805--817. https://doi.org/10.1145/2976749.2978331

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Private Analytics via Streaming, Sketching, and Silently Verifiable Proofs;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19

2. Privacy-preserving recommendation system based on social relationships;Journal of King Saud University - Computer and Information Sciences;2024-02

3. Privacy-Preserving Dijkstra;Lecture Notes in Computer Science;2024

4. Secure Sampling for Approximate Multi-party Query Processing;Proceedings of the ACM on Management of Data;2023-11-13

5. Secure Statistical Analysis on Multiple Datasets: Join and Group-By;2023