The following pages link to Theory of Cryptography (Q5711649):
Displayed 43 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- On the (in)security of the Diffie-Hellman oblivious PRF with multiplicative blinding (Q2061963) (← links)
- Functional encryption for set intersection in the multi-client setting (Q2068378) (← links)
- Private set intersection in the internet setting from lightweight oblivious PRF (Q2102052) (← links)
- MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications (Q2139646) (← links)
- A fast and simple partially oblivious PRF, with applications (Q2170066) (← links)
- Private set intersection: new generic constructions and feasibility results (Q2408281) (← links)
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing (Q2691609) (← links)
- Oblivious pseudorandom functions from isogenies (Q2692394) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function (Q2942846) (← links)
- Efficient Computations over Encrypted Data Blocks (Q2946399) (← links)
- Oblivious Keyword Search with Authorization (Q2953857) (← links)
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (Q3194620) (← links)
- New Communication-Efficient Oblivious Transfer Protocols Based on Pairings (Q3540161) (← links)
- Universally Composable Adaptive Oblivious Transfer (Q3600373) (← links)
- Towards Robust Computation on Encrypted Data (Q3600376) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4625103) (← links)
- Rate-Limited Secure Function Evaluation: Definitions and Constructions (Q4916025) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- Constraining Pseudorandom Functions Privately (Q5738766) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Augmented Oblivious Polynomial Evaluation Protocol and Its Applications (Q5862667) (← links)
- Adaptive oblivious transfer with access control from lattice assumptions (Q5919120) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
- Anonymous tokens with public metadata and applications to private contact tracing (Q6045198) (← links)
- Actively secure arithmetic computation and VOLE with constant computational overhead (Q6061358) (← links)
- Private polynomial commitments and applications to MPC (Q6067356) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
- Structure-aware private set intersection, with applications to fuzzy matching (Q6097267) (← links)
- How to obfuscate MPC inputs (Q6114268) (← links)
- 3-party distributed ORAM from oblivious set membership (Q6134831) (← links)
- Cryptanalysis of an oblivious PRF from supersingular isogenies (Q6157490) (← links)
- ParaDiSE: efficient threshold authenticated encryption in fully malicious model (Q6169456) (← links)
- Malicious secure, structure-aware private set intersection (Q6186605) (← links)