Complete Fairness in Secure Two-Party Computation
From MaRDI portal
Publication:5395668
DOI10.1145/2049697.2049698zbMath1281.94081OpenAlexW2070974172MaRDI QIDQ5395668
Yehuda Lindell, S. Dov Gordon, Carmit Hazay, Jonathan N. Katz
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2049697.2049698
Data encryption (aspects in computer science) (68P25) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (11)
CryptHOL: game-based proofs in higher-order logic ⋮ On fully secure MPC with solitary output ⋮ Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling ⋮ Fully-secure MPC with minimal trust ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ On actively-secure elementary MPC reductions ⋮ \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds ⋮ Quantum secure two-party computation for set intersection with rational players ⋮ Formal Abstractions for Attested Execution Secure Processors ⋮ Protocols for multiparty coin toss with a dishonest majority ⋮ Server-aided private set intersection based on reputation
This page was built for publication: Complete Fairness in Secure Two-Party Computation
