Information-Theoretic Conditions for Two-Party Secure Function Evaluation

DOI10.1007/11761679_32MaRDI QIDQ3593116zbMATH OpenOpenAlexFDO

Authors Claude Crépeau, George Savvides, Christian Schaffner, 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

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Statistical Security Conditions for Two-Party Secure Function Evaluation
• scientific article; zbMATH DE number 1418289
• Completeness in two-party secure computation: a computational view
• Completeness in two-party secure computation: A computational view
• Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation

Cites work

• Coin flipping by telephone a protocol for solving impossible problems
• Foundations of Cryptography
• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• scientific article; zbMATH DE number 3825698 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• scientific article; zbMATH DE number 1951618 (Why is no real title available?)
• scientific article; zbMATH DE number 1955807 (Why is no real title available?)
• scientific article; zbMATH DE number 2085197 (Why is no real title available?)
• Lower Bounds for Oblivious Transfer Reductions
• More general completeness theorems for secure two-party computation
• Oblivious transfer and privacy amplification
• Oblivious Transfer Is Symmetric
• Oblivious transfers and intersecting codes
• Security and composition of multiparty cryptographic protocols
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography

Cited in

(5)

• Bit commitment in the bounded storage model: tight bound and simple optimal construction
• Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
• Statistical Security Conditions for Two-Party Secure Function Evaluation
• Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
• Quantum cryptography beyond quantum key distribution

This page was built for publication: Information-Theoretic Conditions for Two-Party Secure Function Evaluation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593116)