Threshold private set intersection with better communication complexity
From MaRDI portal
Recommendations
- Multi-party threshold private set intersection with sublinear communication
- The communication complexity of threshold private set intersection
- Scalable multi-party private set-intersection
- Improved private set intersection for sets with small entries
- Multiparty cardinality testing for threshold private intersection
Cites work
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
- Advances in Cryptology - EUROCRYPT 2004
- How to simulate it -- a tutorial on the simulation proof technique
- scientific article; zbMATH DE number 1842488 (Why is no real title available?)
- Multi-party threshold private set intersection with sublinear communication
- Multiparty cardinality testing for threshold private intersection
- Privacy-Preserving Set Operations
- PSI from PaXoS: fast, malicious private set intersection
- SpOT-light: lightweight private set intersection from sparse OT extension
- The communication complexity of threshold private set intersection
Cited in
(5)- How to meet big data when private set intersection realizes constant communication complexity
- Multiparty cardinality testing for threshold private intersection
- Multi-party threshold private set intersection with sublinear communication
- Fuzzy private set intersection with large hyperballs
- Fast secure computations on shared polynomials and applications to private set operations
This page was built for publication: Threshold private set intersection with better communication complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6067362)