Pages that link to "Item:Q3058657"
From MaRDI portal
The following pages link to Computationally Secure Pattern Matching in the Presence of Malicious Adversaries (Q3058657):
Displaying 14 items.
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← 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)
- Secure parameterized pattern matching (Q2663480) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- An Efficient Protocol for Oblivious DFA Evaluation and Applications (Q2890023) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- Rate-Limited Secure Function Evaluation: Definitions and Constructions (Q4916025) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Non-interactive secure computation of inner-product from LPN and LWE (Q6135407) (← links)