Efficient Disjointness Tests for Private Datasets
From MaRDI portal
Recommendations
- Unconditionally secure disjointness tests for private datasets
- Financial Cryptography and Data Security
- Advances in Cryptology - EUROCRYPT 2004
- Efficient private set intersection cardinality in the presence of malicious adversaries
- Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Applied Cryptography and Network Security
- Financial Cryptography and Data Security
- Foundations of Cryptography
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1842488 (Why is no real title available?)
- Information and Communications Security
- Matrix multiplication via arithmetic progressions
- Oblivious transfer and polynomial evaluation
- On the complexity of computing determinants
- Privacy-Preserving Set Operations
- Public Key Cryptography - PKC 2006
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Verifiable homomorphic oblivious transfer and private equality test
Cited in
(8)- Unconditionally secure disjointness tests for private datasets
- Encryption switching protocols
- Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
- Financial Cryptography and Data Security
- 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: Efficient Disjointness Tests for Private Datasets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511159)
