Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
From MaRDI portal
Publication:5261630
DOI10.1007/978-3-662-46494-6_10zbMATH Open1354.94020OpenAlexW101616332MaRDI QIDQ5261630FDOQ5261630
Nikolaos Makriyannis, Gilad Asharov, Eran Omri, Amos Beimel
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_10
Cited In (25)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
- On fully secure MPC with solitary output
- On the power of an honest majority in three-party computation without broadcast
- Computational hardness of optimal fair computation: beyond Minicrypt
- On secure computation of solitary output functionalities with and without broadcast
- On the round complexity of fully secure solitary MPC with honest majority
- Synchronizable fair exchange
- Three party secure computation with friends and foes
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation
- Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
- Just how fair is an unreactive world?
- Formal Abstractions for Attested Execution Secure Processors
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- CryptHOL: game-based proofs in higher-order logic
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Can Alice and Bob guarantee output to Carol?
- Fully-secure MPC with minimal trust
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- MPC with friends and foes
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
Recommendations
- Towards Characterizing Complete Fairness in Secure Two-Party Computation 👍 👎
- Complete Fairness in Secure Two-Party Computation 👍 👎
- Complete fairness in secure two-party computation 👍 👎
- Partial fairness in secure two-party computation 👍 👎
- Partial fairness in secure two-party computation 👍 👎
- Secure two-party computation with fairness -- a necessary design principle 👍 👎
- A Full Characterization of Completeness for Two-Party Randomized Function Evaluation 👍 👎
- From fairness to full security in multiparty computation 👍 👎
- From fairness to full security in multiparty computation 👍 👎
- Efficiently Making Secure Two-Party Computation Fair 👍 👎
This page was built for publication: Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261630)
