Pages that link to "Item:Q5962221"
From MaRDI portal
The following pages link to Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221):
Displaying 16 items.
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Private set-intersection with common set-up (Q1783703) (← links)
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer (Q2023253) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- Oblivious key-value stores and amplification for private set intersection (Q2128570) (← links)
- Privacy-preserving pattern matching on encrypted data (Q2692382) (← links)
- Efficient Concurrent Covert Computation of String Equality and Set Intersection (Q2799012) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- Secure Set Intersection with Untrusted Hardware Tokens (Q3073691) (← links)
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (Q3194620) (← links)
- Advances in Cryptology - EUROCRYPT 2004 (Q5307243) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Attaining GOD beyond honest majority with friends and foes (Q6135412) (← links)
- Linear-time 2-party secure merge from additively homomorphic encryption (Q6168324) (← links)
