An Efficient Protocol for Fair Secure Two-Party Computation
From MaRDI portal
Publication:5458934
DOI10.1007/978-3-540-79263-5_6zbMATH Open1153.94402OpenAlexW1878898676MaRDI QIDQ5458934FDOQ5458934
Berry Schoenmakers, Mehmet Sabır Kiraz
Publication date: 24 April 2008
Published in: Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79263-5_6
Recommendations
Cites Work
- Bit commitment using pseudorandomness
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Practical Two-Party Computation Based on the Conditional Gate
- Theory of Cryptography
- Public Key Cryptography - PKC 2006
- Title not available (Why is that?)
- Revisiting the Efficiency of Malicious Two-Party Computation
Cited In (9)
- Title not available (Why is that?)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Information Security and Cryptology
- Efficient A-stable peer two-step methods
- Secure two-party computation with fairness -- a necessary design principle
- A proof of security of Yao's protocol for two-party computation
- Progress in Cryptology - INDOCRYPT 2004
- Two-Prover Protocols---Low Error at Affordable Rates
- 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)
