Pages that link to "Item:Q3588357"
From MaRDI portal
The following pages link to Fast Secure Computation of Set Intersection (Q3588357):
Displaying 15 items.
- Efficient set intersection with simulation-based security (Q271588) (← 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)
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding (Q2061963) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- An efficient approach for secure multi-party computation without authenticated channel (Q2663510) (← links)
- Oblivious pseudorandom functions from isogenies (Q2692394) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- Low-Leakage Secure Search for Boolean Expressions (Q2975821) (← 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)
- Linear-time 2-party secure merge from additively homomorphic encryption (Q6168324) (← links)
