Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
From MaRDI portal
Publication:3194620
DOI10.1007/978-3-319-19962-7_24zbMath1391.94747OpenAlexW955100975MaRDI QIDQ3194620
Rolf Egert, Sven Jacob, Matthias Senker, Jörn Tillmanns, David Gens, Marc Fischlin
Publication date: 20 October 2015
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19962-7_24
Related Items (6)
Privacy-preserving mixed set operations ⋮ Quantum multi-party private set union protocol based on least common multiple and Shor’s algorithm ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion ⋮ Private set operations from oblivious switching ⋮ Two-sided malicious security for private intersection-sum with cardinality
Cites Work
- Efficient set operations in the presence of malicious adversaries
- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
- Secure Set Intersection with Untrusted Hardware Tokens
- Fast Secure Computation of Set Intersection
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Privacy-Preserving Set Union
- Foundations of Cryptography
- A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Advances in Cryptology - EUROCRYPT 2004
- Privacy-Preserving Set Operations
- Space/time trade-offs in hash coding with allowable errors
- Theory of Cryptography
- Financial Cryptography and Data Security
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
This page was built for publication: Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
