Statistical Security Conditions for Two-Party Secure Function Evaluation

DOI10.1007/978-3-540-85093-9_9MaRDI QIDQ5502794zbMATH OpenOpenAlexFDO

Authors Claude Crépeau, Jürg Wullschleger

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

information-theoretic securityoblivious transfersecure function evaluationsecurity definition

Mathematics Subject Classification ID

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

Recommendations

• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• On statistical security in two-party computation
• Completeness in two-party secure computation: a computational view
• Completeness in two-party secure computation: A computational view
• Communication preserving protocols for secure function evaluation

Cites work

• A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
• A Mathematical Theory of Communication
• Composing Quantum Protocols in a Classical Environment
• Foundations of Cryptography
• scientific article; zbMATH DE number 3825698 (Why is no real title available?)
• scientific article; zbMATH DE number 4051007 (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 503243 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• More general completeness theorems for secure two-party computation
• Oblivious-Transfer Amplification
• Security and composition of multiparty cryptographic protocols
• Symmetric authentication within a simulatable cryptographic library
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(3)

• On statistical security in two-party computation
• Information-Theoretic Conditions for Two-Party Secure Function Evaluation
• Secure identification and QKD in the bounded-quantum-storage model

This page was built for publication: Statistical Security 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 Q5502794)