2019 · 37 citations · 11 references
ComputingComputer ScienceComputer SecurityCryptographySecurity ProtocolsCryptographic Protocol DesignCryptographic ProtocolsProtocol AnalysisSecure Multi-party ComputationSecurity Protocol VerificationPrivate Set Intersection
We construct new protocols for two parties to securely compute on the items in their intersection. Our protocols make use of an untrusted third party that has no input. The use of this party allows us to construct highly efficient protocols that are secure against a single malicious corruption.
11
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
Toshinori Araki, Jun Furukawa, Yehuda Lindell et al. · 2016 · 389 citations
When private set intersection meets big data
Changyu Dong, Liqun Chen, Zikai Alex Wen · 2013 · 372 citations
Efficient Batched Oblivious PRF with Applications to Private Set Intersection
Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek et al. · 2016 · 355 citations · Full text
Secure two-party computation in sublinear (amortized) time
Steven Gordon, Jonathan Katz, Vladimir Kolesnikov et al. · 2012 · 178 citations
Labeled PSI from Fully Homomorphic Encryption with Malicious Security
Hao Chen, Zhicong Huang, Kim Laine et al. · 2018 · 168 citations · Full text