An Efficient Protocol for Fair Secure Two-Party Computation
From MaRDI portal
Recommendations
Cites work
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Bit commitment using pseudorandomness
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 2009950 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Practical Two-Party Computation Based on the Conditional Gate
- Public Key Cryptography - PKC 2006
- Revisiting the Efficiency of Malicious Two-Party Computation
- Theory of Cryptography
Cited in
(11)- A proof of security of Yao's protocol for two-party computation
- Secure two-party computation with fairness -- a necessary design principle
- Efficient A-stable peer two-step methods
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- scientific article; zbMATH DE number 2009950 (Why is no real title available?)
- Two-Prover Protocols---Low Error at Affordable Rates
- Progress in Cryptology - INDOCRYPT 2004
- Efficiently making secure two-party computation fair
- Fast optimistically fair cut-and-choose 2PC
- Information Security and Cryptology
- Public Key Cryptography - PKC 2006
This page was built for publication: An Efficient Protocol for Fair Secure Two-Party Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458934)