The following pages link to Mike Rosulek (Q775979):
Displaying 33 items.
- Optimizing authenticated garbling for faster secure two-party computation (Q775980) (← links)
- On the structure of unconditional UC hybrid protocols (Q1631320) (← links)
- Improvements for gate-hiding garbled circuits (Q1746851) (← links)
- Private set operations from oblivious switching (Q2061976) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
- Oblivious key-value stores and amplification for private set intersection (Q2128570) (← links)
- Characterizing collision and second-preimage resistance in Linicrypt (Q2175923) (← links)
- Scalable private set union from symmetric-key techniques (Q2176668) (← links)
- SpOT-light: lightweight private set intersection from sparse OT extension (Q2304926) (← links)
- Reconciling non-malleability with homomorphic encryption (Q2408582) (← links)
- SWiM: secure wildcard pattern matching from OT extension (Q2656943) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR (Q2874552) (← links)
- A Unified Characterization of Completeness and Triviality for Secure Function Evaluation (Q2876922) (← links)
- Must You Know the Code of f to Securely Compute f? (Q2914255) (← links)
- Universal Composability from Essentially Any Trusted Setup (Q2914272) (← links)
- How to Efficiently Evaluate RAM Programs with Malicious Security (Q2948351) (← links)
- Exploring the Limits of Common Coins Using Frontier Analysis of Protocols (Q3000558) (← links)
- Attribute-Based Signatures (Q3073718) (← links)
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost (Q3457064) (← links)
- Homomorphic Encryption with CCA Security (Q3519541) (← links)
- A Zero-One Law for Cryptographic Complexity with Respect to Computational UC Security (Q3582779) (← links)
- Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations (Q3600224) (← links)
- Towards Robust Computation on Encrypted Data (Q3600376) (← links)
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation (Q3611770) (← links)
- Rerandomizable RCCA Encryption (Q3612568) (← links)
- Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities (Q4910282) (← links)
- Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction (Q4924433) (← links)
- Richer Efficiency/Security Trade-offs in 2PC (Q5261631) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Improved Private Set Intersection Against Malicious Adversaries (Q5738879) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
