Secure-Computation-Friendly Private Set Intersection from Oblivious Compact Graph Evaluation-Reference-Cited by-同舟云学术

Secure-Computation-Friendly Private Set Intersection from Oblivious Compact Graph Evaluation

Published:2022-05-30 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Ma Jack P. K.¹,Chow Sherman S. M.¹

Affiliation:

1. The Chinese University of Hong Kong, Shatin, Hong Kong

Funder

Research Grants Council, University Grant Committee of Hong Kong

Publisher

ACM

Link

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

Reference38 articles.

1. Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation

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

3. Donald Beaver , Silvio Micali , and Phillip Rogaway . 1990 . The Round Complexity of Secure Protocols (Extended Abstract) . In ACM Symposium on Theory of Computing (STOC). 503--513 . Donald Beaver, Silvio Micali, and Phillip Rogaway. 1990. The Round Complexity of Secure Protocols (Extended Abstract). In ACM Symposium on Theory of Computing (STOC). 503--513.

4. Alexandra Boldyreva Nathan Chenette Younho Lee and Adam O'Neill. 2009. Order-Preserving Symmetric Encryption. In EUROCRYPT. 224--241. Alexandra Boldyreva Nathan Chenette Younho Lee and Adam O'Neill. 2009. Order-Preserving Symmetric Encryption. In EUROCRYPT. 224--241.

5. Secure Computation with Preprocessing via Function Secret Sharing

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

1. A Practical Multiparty Private Set Intersection Protocol Based on Bloom Filters for Unbalanced Scenarios;Applied Sciences;2023-12-13