Fast Secure Computation of Set Intersection
From MaRDI portal
Publication:3588357
DOI10.1007/978-3-642-15317-4_26zbMath1291.94105OpenAlexW1577229502MaRDI QIDQ3588357
Stanislaw Jarecki, Xiaomin Liu
Publication date: 10 September 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15317-4_26
Related Items (18)
Efficient set intersection with simulation-based security ⋮ Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters ⋮ An efficient approach for secure multi-party computation without authenticated channel ⋮ Private set intersection: new generic constructions and feasibility results ⋮ Structure-aware private set intersection, with applications to fuzzy matching ⋮ Finding one common item, privately ⋮ Linear-time 2-party secure merge from additively homomorphic encryption ⋮ Malicious secure, structure-aware private set intersection ⋮ Oblivious pseudorandom functions from isogenies ⋮ Laconic private set intersection and applications ⋮ Low-Leakage Secure Search for Boolean Expressions ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Scalable Multi-party Private Set-Intersection ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Private set-intersection with common set-up ⋮ Secure Set Intersection with Untrusted Hardware Tokens ⋮ On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding
This page was built for publication: Fast Secure Computation of Set Intersection
