Pages that link to "Item:Q3058658"
From MaRDI portal
The following pages link to Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model (Q3058658):
Displaying 26 items.
- Rate-limited secure function evaluation (Q329720) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Private set-intersection with common set-up (Q1783703) (← links)
- Secure and efficient multiparty private set intersection cardinality (Q2025374) (← links)
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE (Q2056777) (← links)
- Multiparty cardinality testing for threshold private intersection (Q2061947) (← links)
- Multi-party threshold private set intersection with sublinear communication (Q2061962) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Private set intersection in the internet setting from lightweight oblivious PRF (Q2102052) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- Attribute-based fine-grained access control for outscored private set intersection computation (Q2666793) (← links)
- Bounded Size-Hiding Private Set Intersection (Q2827733) (← links)
- New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness (Q2988351) (← links)
- Secure Set Intersection with Untrusted Hardware Tokens (Q3073691) (← links)
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (Q3194620) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Improved Private Set Intersection Against Malicious Adversaries (Q5738879) (← links)
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets (Q5857774) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
- A proof of the conjectured run time of the Hafner-McCurley class group algorithm (Q6047436) (← links)
- Practical and malicious private set intersection with improved efficiency (Q6122611) (← links)
- Finding one common item, privately (Q6134834) (← links)
- Element distinctness and bounded input size in private set intersection and related protocols (Q6547968) (← links)
- A secure quantum private set computation protocol with identity authentication utilizing GHZ states (Q6571264) (← links)
- Private computations on set intersection (Q6613361) (← links)
