The following pages link to Oblivious Transfer Is Symmetric (Q3593098):
Displaying 27 items.
- Oblivious transfer and quantum channels as communication resources (Q269051) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Secure computation using leaky correlations (asymptotically optimal constructions) (Q1631316) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- One-way functions imply secure computation in a quantum world (Q2120090) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- On the feasibility of extending oblivious transfer (Q2413614) (← links)
- On the power of non-local boxes (Q2503267) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost (Q3457064) (← links)
- Error-Tolerant Combiners for Oblivious Primitives (Q3519523) (← links)
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation (Q3593116) (← links)
- Adaptively Secure Two-Party Computation with Erasures (Q3623039) (← links)
- On Oblivious Transfer Capacity (Q4915234) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Oblivious transfer based on single-qubit rotations (Q5272497) (← links)
- Cryptography and Game Theory: Designing Protocols for Exchanging Information (Q5445513) (← links)
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- Secure non-interactive simulation from arbitrary joint distributions (Q6114278) (← links)
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness (Q6169419) (← links)
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states (Q6562577) (← links)
- On the correlation complexity of MPC with cheater identification (Q6573954) (← links)
- Lower-bounds on public-key operations in PIR (Q6637562) (← links)
- \textsf{LR-OT}: leakage-resilient oblivious transfer (Q6660389) (← links)
