The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Fast Private Set Intersection from Homomorphic Encryption
Abstract
Private Set Intersection (PSI) is a cryptographic technique that allows two parties to compute the intersection of their sets without revealing anything except the intersection. We use fully homomorphic encryption to construct a fast PSI protocol with a small communication overhead that works particularly well when one of the two sets is much smaller than the other, and is secure against semi-honest adversaries.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
(2016) · International Conference on Machine Learning · Cited by 1,270
Efficient Private Matching and Set Intersection
Freedman, M. J., Nissim, K., & Pinkas, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_1 · Cited by 1,266
Somewhat Practical Fully Homomorphic Encryption.
Fan, J., & Vercauteren, F. (2012) · Cited by 1,189
On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
López-Alt, A., Tromer, E., & Vaikuntanathan, V. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2214086 · Cited by 910
On the concrete hardness of Learning with Errors
Albrecht, M. R., Player, R., & Scott, S. (2015) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2015-0016 · Cited by 861
Homomorphic Evaluation of the AES Circuit
Gentry, C., Halevi, S., & Smart, N. P. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_49 · Cited by 796
Extending Oblivious Transfers Efficiently
Ishai, Y., Kilian, J., Nissim, K., & Petrank, E. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_9 · Cited by 746
Fully homomorphic SIMD operations
Smart, N. P., & Vercauteren, F. (2014) · Designs, Codes and Cryptography · doi:10.1007/s10623-012-9720-4 · Cited by 656
One-Way Accumulators: A Decentralized Alternative to Digital Signatures
Benaloh, J., & de Mare, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_24 · Cited by 572
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
Brakerski, Z., & Vaikuntanathan, V. (2014) · SIAM Journal on Computing · doi:10.1137/120868669 · Cited by 538
“Balls into Bins” — A Simple and Tight Analysis
Raab, M., & Steger, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49543-6_13 · Cited by 455
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Asharov, G., Jain, A., López-Alt, A., Tromer, E., Vaikuntanathan, V., & Wichs, D. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_29 · Cited by 454
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme
Bos, J. W., Lauter, K., Loftus, J., & Naehrig, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-45239-0_4 · Cited by 421
When private set intersection meets big data: an efficient and scalable protocol
Dong, C., Chen, L., & Wen, Z. (2013) · Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security - CCS '13 · doi:10.1145/2508859.2516701 · Cited by 387
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
Kolesnikov, V., Kumaresan, R., Rosulek, M., & Trieu, N. (2016) · Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/2976749.2978381 · Cited by 380
Scalable Private Set Intersection Based on OT Extension
Pinkas, B., Schneider, T., & Zohner, M. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3154794 · Cited by 313
Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?
Huang, Y., Evans, D., & Katz, J. I. (2012) · Cited by 301
Simple Encrypted Arithmetic Library - SEAL v2.1
Chen, H., Laine, K., & Player, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70278-0_1 · Cited by 275
Self-citationHazay, C., & Lindell, Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_10 · Cited by 267
Faster Private Set Intersection based on OT Extension.Preprint
Benny Pinkas, B., Schneider, T. H., & Zohner, M. (2014) · IACR Cryptology ePrint Archive · Cited by 236
Enhancing privacy and trust in electronic communities
Huberman, B. A., Franklin, M., & Hogg, T. (1999) · Proceedings of the 1st ACM conference on Electronic commerce · doi:10.1145/336992.337012 · Cited by 224
Packed Ciphertexts in LWE-Based Homomorphic Encryption
Brakerski, Z., Gentry, C., & Halevi, S. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36362-7_1 · Cited by 207
Meadows, C. (1986) · 1986 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1986.10022 · Cited by 207
A Guide to Fully Homomorphic Encryption.
Armknecht, F., Boyd, C., Carr, C., Gjøsteen, K., Jäschke, A., Reuter, C. A., & Strand, M. (2015) · MADOC (University of Mannheim) · Cited by 207
Phasing: Private Set Intersection using Permutation-based Hashing.
Benny Pinkas, B., Schneider, T. H., Segev, G., & Zohner, M. (2015) · Cited by 180
Efficient Robust Private Set Intersection
Dachman-Soled, D., Malkin, T., Raykova, M., & Yung, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01957-9_8 · Cited by 160
On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL
Albrecht, M. R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56614-6_4 · Cited by 154
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-14623-7_9 · Cited by 140
(If) Size Matters: Size-Hiding Private Set Intersection
Ateniese, G., Cristofaro, E. D., & Tsudik, G. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19379-8_10 · Cited by 120
Improved Private Set Intersection Against Malicious Adversaries
Rindal, P., & Rosulek, M. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-56620-7_9 · Cited by 120
Self-citationBackyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
Arbitman, Y., Naor, M., & Segev, G. (2010) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2010.80 · Cited by 105
Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?
Costache, A., & Smart, N. P. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-29485-8_19 · Cited by 84
Efficient Set Operations in the Presence of Malicious Adversaries
Hazay, C., & Kobbi Nissim, B. (2011) · Journal of Cryptology · doi:10.1007/s00145-011-9098-x · Cited by 62
Sanitization of FHE Ciphertexts
Ducas, L., & Stehlé, D. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-49890-3_12 · Cited by 59
Cited by
A Survey of COVID-19 Contact Tracing Apps
Ahmed, N., Michelin, R. A., Xue, W., Ruj, S., Malaney, R., Kanhere, S. S., Seneviratne, A., Hu, W., Janicke, H., & Jha, S. K. (2020) · IEEE Access · doi:10.1109/access.2020.3010226 · Cited by 582
Horizontal Federated Recommender System: A Survey
Wang, L., Zhou, H., Bao, Y., Yan, X., Shen, G., & Kong, X. (2024) · ACM Computing Surveys · doi:10.1145/3656165 · Cited by 37
Secure Federated Submodel Learning
Niu, C., Wu, F., Tang, S., Hua, L., Jia, R., Lv, C., Wu, Z., & Chen, G. (2019) · arXiv · doi:10.48550/arxiv.1911.02254 · Cited by 28
CryptoRec: Novel Collaborative Filtering Recommender Made Privacy-Preserving Easy
Wang, J., Jin, C., Tang, Q., Liu, Z., & Aung, K. M. M. (2022) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3065752 · Cited by 9
Metadata
- Authors
- Chen, H., Laine, K., & Rindal, P.
- Venue
- Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2017-10-30
- Volume
- 2017
- Pages
- 1243-1255
- OpenAlex
- W2766393794
- Cited by
- 352
- References
- 38
- FWCI
- 8.77
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.