Oblivious Transfer Is Symmetric

From MaRDI portal
Publication:3593098

DOI10.1007/11761679_14zbMath1140.94372OpenAlexW1551076855MaRDI QIDQ3593098

Jürg Wullschleger, Stefan Wolf

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




Related Items (25)

One-way functions imply secure computation in a quantum worldOblivious transfer and quantum channels as communication resourcesSecure computation using leaky correlations (asymptotically optimal constructions)More efficient DDH pseudorandom generatorsEfficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized CostAsymptotically quasi-optimal cryptographyOn the feasibility of extending oblivious transferStatistical security in two-party computation revisitedSecure non-interactive simulation from arbitrary joint distributionsGeneral properties of quantum bit commitments (extended abstract)On perfectly secure two-party computation for symmetric functionalities with correlated randomnessError-Tolerant Combiners for Oblivious PrimitivesEfficient one-sided adaptively secure computationOn Oblivious Transfer CapacityUnconditional UC-Secure Computation with (Stronger-Malicious) PUFsInformation-Theoretic Conditions for Two-Party Secure Function EvaluationOn the power of non-local boxesCryptography and Game Theory: Designing Protocols for Exchanging InformationAdaptively Secure Two-Party Computation with ErasuresOn perfectly secure 2PC in the OT-hybrid modelOn perfectly secure 2PC in the OT-hybrid modelStatistical Zaps and new oblivious transfer protocolsNetwork Oblivious TransferFinding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding CommitmentsOblivious transfer based on single-qubit rotations



Cites Work




This page was built for publication: Oblivious Transfer Is Symmetric