The following pages link to (Q2768332):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Smooth projective hashing and two-message oblivious transfer (Q421036) (← links)
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- Efficient \(k\)-out-of-\(n\) oblivious transfer scheme with the ideal communication cost (Q1694723) (← links)
- Flexible quantum oblivious transfer (Q1705113) (← links)
- Oblivious keyword search (Q1827575) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
- Secure two-party computation in a quantum world (Q2229292) (← links)
- Secure linear system computation in the presence of malicious adversaries (Q2335946) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- Generic Construction of UC-Secure Oblivious Transfer (Q2794494) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- An Efficient Protocol for Oblivious DFA Evaluation and Applications (Q2890023) (← links)
- The Simplest Protocol for Oblivious Transfer (Q2946440) (← links)
- Adaptive Oblivious Transfer and Generalization (Q2953778) (← links)
- Structure-Preserving Smooth Projective Hashing (Q2953782) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Weak Oblivious Transfer from Strong One-Way Functions (Q3092347) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
