Secret-Shared Joins with Multiplicity from Aggregation Trees-Reference-Cited by-同舟云学术

Secret-Shared Joins with Multiplicity from Aggregation Trees

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:

Badrinarayanan Saikrishna¹,Das Sourav²,Garimella Gayathri³,Raghuraman Srinivasan⁴,Rindal Peter⁴

Affiliation:

1. Snap, Palo Alto, CA, USA

2. University of Illinois Urbana Champaign, Champaign, IL, USA

3. Oregon State University, Corvallis, OR, USA

4. Visa Research, Palo Alto, CA, USA

Publisher

ACM

Link

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

Reference35 articles.

1. Ciphers for MPC and FHE

2. Exploratory Study of Privacy Preserving Fraud Detection

3. Labeled PSI from Fully Homomorphic Encryption with Malicious Security

4. Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS. Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS.

5. Koji Chida Koki Hamada Dai Ikarashi Ryo Kikuchi Naoto Kiribuchi and Benny Pinkas. 2019a. An Efficient Secure Three-Party Sorting Protocol with an Honest Majority. IACR Cryptol. ePrint Arch. (2019) 695. https://eprint.iacr.org/2019/695 Koji Chida Koki Hamada Dai Ikarashi Ryo Kikuchi Naoto Kiribuchi and Benny Pinkas. 2019a. An Efficient Secure Three-Party Sorting Protocol with an Honest Majority. IACR Cryptol. ePrint Arch. (2019) 695. https://eprint.iacr.org/2019/695

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

1. Relational Algorithms for Top-k Query Evaluation;Proceedings of the ACM on Management of Data;2024-05-29

2. Secure and Practical Functional Dependency Discovery in Outsourced Databases;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

3. Improved Alternating-Moduli PRFs and Post-quantum Signatures;Lecture Notes in Computer Science;2024