Statistical Security Conditions for Two-Party Secure Function Evaluation

DOI10.1007/978-3-540-85093-9_9zbMath1162.94350OpenAlexW1520392468MaRDI QIDQ5502794

Jürg Wullschleger, Claude Crépeau

Publication date: 9 January 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85093-9_9

zbMATH Keywords

secure function evaluationinformation-theoretic securityoblivious transfersecurity definition

Mathematics Subject Classification ID

Cryptography (94A60) Information theory (general) (94A15) Distributed systems (68M14) Network protocols (68M12)

Related Items (1)

Secure identification and QKD in the bounded-quantum-storage model

Cites Work

• A Mathematical Theory of Communication
• Security and composition of multiparty cryptographic protocols
• More general completeness theorems for secure two-party computation
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• Composing Quantum Protocols in a Classical Environment
• The Knowledge Complexity of Interactive Proof Systems
• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• Foundations of Cryptography
• Symmetric Authentication within a Simulatable Cryptographic Library
• Oblivious-Transfer Amplification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Statistical Security Conditions for Two-Party Secure Function Evaluation