Testing disjointness of private datasets
From MaRDI portal
Recommendations
Cited in
(9)- Unconditionally secure disjointness tests for private datasets
- Efficient set intersection with simulation-based security
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Efficient Disjointness Tests for Private Datasets
- Privacy-preserving subgraph matching protocol for two parties
- Applied Cryptography and Network Security
- Mixed-technique multi-party computations composed of two-party computations
- Fast secure computations on shared polynomials and applications to private set operations
- A communication-efficient private matching scheme in client-server model
This page was built for publication: Testing disjointness of private datasets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5712234)