Oblivious Transfer Is Symmetric
From MaRDI portal
Publication:3593098
DOI10.1007/11761679_14zbMATH Open1140.94372OpenAlexW1551076855MaRDI QIDQ3593098FDOQ3593098
Authors: S. Wolf, Jürg Wullschleger 
Publication date: 24 September 2007
Published in: Advances in Cryptology - EUROCRYPT 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11761679_14
Recommendations
- Equivocable oblivious transfer
- Oblivious Transfer Based on Key Exchange
- scientific article; zbMATH DE number 2080673
- Oblivious Transfer Based on the McEliece Assumptions
- Computationally secure oblivious transfer
- On the Reversibility of Oblivious Transfer
- Oblivious Transfer Using Elliptic Curves
- Oblivious transfer and privacy amplification
- Oblivious Transfer from Weak Noisy Channels
- Efficient oblivious transfer protocols
Cites Work
- A Mathematical Theory of Communication
- Oblivious transfer and polynomial evaluation
- Title not available (Why is that?)
- Foundations of Cryptography
- New Monotones and Lower Bounds in Unconditional Two-Party Computation
- The Wire-Tap Channel
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new outlook on Shannon's information measures
- Oblivious transfer and privacy amplification
- On the Reversibility of Oblivious Transfer
- Security in Communication Networks
- Cryptography and Coding
- Title not available (Why is that?)
Cited In (30)
- Secure non-interactive simulation from arbitrary joint distributions
- One-way functions imply secure computation in a quantum world
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- All complete functionalities are reversible
- Oblivious transfer and quantum channels as communication resources
- On the correlation complexity of MPC with cheater identification
- Efficient zero-knowledge proofs of non-algebraic statements with sublinear amortized cost
- Information-Theoretic Conditions for Two-Party Secure Function Evaluation
- Secure computation using leaky correlations (asymptotically optimal constructions)
- On oblivious transfer capacity
- Network oblivious transfer
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- On the feasibility of extending oblivious transfer
- Unconditional UC-secure computation with (stronger-malicious) PUFs
- On the power of non-local boxes
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Adaptively Secure Two-Party Computation with Erasures
- Asymptotically quasi-optimal cryptography
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Statistical Zaps and new oblivious transfer protocols
- Lower-bounds on public-key operations in PIR
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness
- Error-Tolerant Combiners for Oblivious Primitives
- \textsf{LR-OT}: leakage-resilient oblivious transfer
- More efficient DDH pseudorandom generators
- Oblivious transfer based on single-qubit rotations
- Statistical security in two-party computation revisited
- General properties of quantum bit commitments (extended abstract)
- Efficient one-sided adaptively secure computation
This page was built for publication: Oblivious Transfer Is Symmetric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593098)
