Information-Theoretic Conditions for Two-Party Secure Function Evaluation
From MaRDI portal
Publication:3593116
DOI10.1007/11761679_32zbMath1140.94333OpenAlexW1531015602MaRDI QIDQ3593116
Christian Schaffner, Claude Crépeau, George Savvides, 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_32
Related Items (4)
Quantum cryptography beyond quantum key distribution ⋮ Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction ⋮ Statistical Security Conditions for Two-Party Secure Function Evaluation ⋮ Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Oblivious transfer and privacy amplification
- Security and composition of multiparty cryptographic protocols
- Oblivious transfers and intersecting codes
- More general completeness theorems for secure two-party computation
- Oblivious Transfer Is Symmetric
- The Knowledge Complexity of Interactive Proof Systems
- Coin flipping by telephone a protocol for solving impossible problems
- Lower Bounds for Oblivious Transfer Reductions
- Foundations of Cryptography
- Theory of Cryptography
This page was built for publication: Information-Theoretic Conditions for Two-Party Secure Function Evaluation