Pages that link to "Item:Q3655172"
From MaRDI portal
The following pages link to Private Intersection of Certified Sets (Q3655172):
Displaying 18 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- A communication-efficient private matching scheme in client-server model (Q726566) (← links)
- Private set-intersection with common set-up (Q1783703) (← links)
- Secure and efficient multiparty private set intersection cardinality (Q2025374) (← links)
- Private set operations from oblivious switching (Q2061976) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Polynomial representation is tricky: maliciously secure private set intersection revisited (Q2148772) (← links)
- Enforcing input correctness via certification in garbled circuit evaluation (Q2167732) (← links)
- Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
- Quantum private set intersection cardinality and its application to anonymous authentication (Q2282131) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function (Q2942846) (← links)
- Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter (Q2980879) (← links)
- New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness (Q2988351) (← links)
- Practical and malicious private set intersection with improved efficiency (Q6122611) (← links)
- Private computations on set intersection (Q6613361) (← links)
