The communication complexity of threshold private set intersection
From MaRDI portal
Recommendations
- Multi-party threshold private set intersection with sublinear communication
- Multiparty cardinality testing for threshold private intersection
- Advances in Cryptology - EUROCRYPT 2004
- Scalable multi-party private set-intersection
- Private set intersection: new generic constructions and feasibility results
Cited in
(18)- Hiding the input-size in multi-party private set intersection
- How to meet big data when private set intersection realizes constant communication complexity
- Robust property-preserving hash functions for Hamming distance and more
- SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter
- Multi-party updatable delegated private set intersection
- Polynomial representation is tricky: maliciously secure private set intersection revisited
- New framework for structure-aware PSI from distributed function secret sharing
- Private computations on set intersection
- Improved private set intersection for sets with small entries
- Two-round oblivious linear evaluation from learning with errors
- Fast secure computations on shared polynomials and applications to private set operations
- Fuzzy private set intersection with large hyperballs
- Multiparty cardinality testing for threshold private intersection
- Multi-party threshold private set intersection with sublinear communication
- Oblivious key-value stores and amplification for private set intersection
- Structure-aware private set intersection, with applications to fuzzy matching
- Computation efficient structure-aware PSI from incremental function secret sharing
- Threshold private set intersection with better communication complexity
This page was built for publication: The communication complexity of threshold private set intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2304976)
