Linear-complexity private set intersection protocols secure in malicious model
From MaRDI portal
Recommendations
- An algebraic approach to maliciously secure private set intersection
- Efficient private set intersection cardinality in the presence of malicious adversaries
- Improved private set intersection against malicious adversaries
- PSI from PaXoS: fast, malicious private set intersection
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
Cited in
(44)- Efficient private set intersection cardinality in the presence of malicious adversaries
- Scalable multi-party private set-intersection
- Finding one common item, privately
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
- A secure quantum private set computation protocol with identity authentication utilizing GHZ states
- Private set intersection: new generic constructions and feasibility results
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- New realizations of efficient and secure private set intersection protocols preserving fairness
- Efficient set operations in the presence of malicious adversaries
- Secure and efficient multiparty private set intersection cardinality
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm
- Private polynomial commitments and applications to MPC
- Polynomial representation is tricky: maliciously secure private set intersection revisited
- Practically efficient private set intersection from trusted hardware with side-channels
- Attribute-based fine-grained access control for outscored private set intersection computation
- An algebraic approach to maliciously secure private set intersection
- Private intersection of certified sets
- Nothing refreshes like a RePSI: reactive private set intersection
- Laconic cryptography with preprocessing
- Laconic PSI on authenticated inputs and applications
- Malicious secure, structure-aware private set intersection
- Credibility in private set membership
- Private computations on set intersection
- Faster unbalanced private set intersection
- Private set-intersection with common set-up
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Improved private set intersection for sets with small entries
- Rate-limited secure function evaluation
- Improved private set intersection against malicious adversaries
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- Efficient circuit-based PSI with linear communication
- Privately computing set-union and set-intersection cardinality via Bloom filters
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- Multiparty cardinality testing for threshold private intersection
- Multi-party threshold private set intersection with sublinear communication
- Bounded size-hiding private set intersection
- Two-sided malicious security for private intersection-sum with cardinality
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Secure set intersection with untrusted hardware tokens
- Practical and malicious private set intersection with improved efficiency
- Element distinctness and bounded input size in private set intersection and related protocols
This page was built for publication: Linear-complexity private set intersection protocols secure in malicious model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3058658)
