Fast Unbalanced Private Set Union from Fully Homomorphic Encryption-Reference-Cited by-同舟云学术

Fast Unbalanced Private Set Union from Fully Homomorphic Encryption

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

Author:

Tu Binbin¹^ORCID,Chen Yu¹^ORCID,Liu Qi¹^ORCID,Zhang Cong²^ORCID

Affiliation:

1. Shandong University, Qingdao, China

2. IIE, CAS, Beijing, China

Funder

National Key Research and Development Program of China

National Natural Science Foundation of China

Department of Science & Technology of Shandong Province

Publisher

ACM

Link

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

Reference49 articles.

1. More efficient oblivious transfer and extensions for faster secure computation

2. Private and oblivious set and multiset operations

3. Florian Bourse, Rafaë l Del Pino, Michele Minelli, and Hoeteck Wee. 2016. FHE Circuit Privacy Almost for Free. In Advances in Cryptology - CRYPTO 2016 - 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part II, Matthew Robshaw and Jonathan Katz (Eds.). Springer, 62--89.

4. Packed Ciphertexts in LWE-Based Homomorphic Encryption

5. (Leveled) fully homomorphic encryption without bootstrapping

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

1. Private Set Operations from Multi-query Reverse Private Membership Test;Lecture Notes in Computer Science;2024

2. Review the Cuckoo Hash-Based Unbalanced Private Set Union: Leakage, Fix, and Optimization;Lecture Notes in Computer Science;2024