An Unconditionally Secure Protocol for Multi-Party Set Intersection
From MaRDI portal
Recommendations
- Information Theoretically Secure Multi Party Set Intersection Re-visited
- Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
- Fast secure computation of set intersection
- Advances in Cryptology - EUROCRYPT 2004
- Scalable multi-party private set-intersection
Cited in
(14)- Private graph intersection protocol
- Simple multi-party set reconciliation
- Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation
- Constant-Round Multi-party Private Set Union Using Reversed Laurent Series
- Invertible polynomial representation for private set operations
- Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
- Information Theoretically Secure Multi Party Set Intersection Re-visited
- GUC-secure set-intersection computation
- Secure computation of two set-relationships with the unencrypted method
- A ciphertext-based proxy secure two-party computation protocol
- scientific article; zbMATH DE number 7267018 (Why is no real title available?)
- Quantum multi-party private set union protocol based on least common multiple and Shor’s algorithm
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Fast secure computations on shared polynomials and applications to private set operations
This page was built for publication: An Unconditionally Secure Protocol for Multi-Party Set Intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612384)