An efficient toolkit for computing private set operations
From MaRDI portal
Recommendations
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Scalable private set union from symmetric-key techniques
- Private set operations from oblivious switching
- Efficient scalable multiparty private set-intersection via garbled Bloom filters
- Privacy-Preserving Set Operations
Cited in
(18)- Private set operations from oblivious switching
- Scalable private set union from symmetric-key techniques
- Enabling privacy-preserving non-interactive computation for Hamming distance
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Efficient Concurrent Covert Computation of String Equality and Set Intersection
- Efficient private set intersection cardinality protocol in the reverse unbalanced setting
- Invertible polynomial representation for private set operations
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Secure and efficient multiparty private set intersection cardinality
- Hiding the input-size in multi-party private set intersection
- Privacy-Preserving Set Operations
- Mixed-technique multi-party computations composed of two-party computations
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Private set operations from multi-query reverse private membership test
- Efficient scalable multiparty private set-intersection via garbled Bloom filters
- Constant-round privacy preserving multiset union
- Privacy-preserving mixed set operations
- Privacy-preserving disjunctive normal form operations on distributed sets
This page was built for publication: An efficient toolkit for computing private set operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014617)
