The following pages link to (Q3210162):
Displaying 30 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Translucent cryptography -- an alternative to key escrow, and its implementation via fractional oblivious transfer (Q1291806) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Laconic oblivious transfer and its applications (Q1678362) (← links)
- Flexible quantum oblivious transfer (Q1705113) (← links)
- Oblivious keyword search (Q1827575) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Oblivious polynomial evaluation and oblivious neural learning (Q2566001) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation (Q2817471) (← links)
- A Game-Theoretic Perspective on Oblivious Transfer (Q2907359) (← links)
- The Simplest Protocol for Oblivious Transfer (Q2946440) (← links)
- Oblivious transfers and intersecting codes (Q3129464) (← links)
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens (Q3408203) (← links)
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes (Q3452347) (← links)
- Improved Garbled Circuit: Free XOR Gates and Applications (Q3519525) (← links)
- Decentralized Anonymous Micropayments (Q5267420) (← links)
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer (Q5387104) (← links)
- Cryptography and Game Theory: Designing Protocols for Exchanging Information (Q5445513) (← links)
- Oblivious Transfer Based on the McEliece Assumptions (Q5502796) (← links)
- Non-interactive Mimblewimble transactions, revisited (Q6135418) (← links)
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model (Q6488035) (← links)
- Towards topology-hiding computation from oblivious transfer (Q6581794) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
