Partial fairness in secure two-party computation
From MaRDI portal
Publication:421046
DOI10.1007/s00145-010-9079-5zbMath1272.94032OpenAlexW1964545136MaRDI QIDQ421046
S. Dov Gordon, Jonathan N. Katz
Publication date: 23 May 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-010-9079-5
Related Items (11)
Incentive-driven attacker for corrupting two-party protocols ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ An optimally fair coin toss ⋮ Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious ⋮ Toward a game theoretic view of secure computation ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Fully-secure MPC with minimal trust ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ Efficient Rational Secret Sharing in Standard Communication Networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Session-key generation using human passwords only
- Practical and provably secure release of a secret and exchange of signatures
- Security and composition of multiparty cryptographic protocols
- Partial Fairness in Secure Two-Party Computation
- Protocols for Multiparty Coin Toss with Dishonest Majority
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- An Optimally Fair Coin Toss
- Complete Fairness in Multi-party Computation without an Honest Majority
- Foundations of Cryptography
- Concurrent zero-knowledge
- Completely fair SFE and coalition-safe cheap talk
- Theory of Cryptography
This page was built for publication: Partial fairness in secure two-party computation
