Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions

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
Efficiently making secure two-party computation fair

Cited in

(27)

Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
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
Just how fair is an unreactive world?
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
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
Formal abstractions for attested execution secure processors
Can Alice and Bob guarantee output to Carol?
Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
Fully-secure MPC with minimal trust
Towards characterizing complete fairness in secure two-party computation
Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
On the classification of finite Boolean functions up to fairness
A full characterization of functions that imply fair coin tossing and ramifications to fairness
Black-box use of one-way functions is useless for optimal fair coin-tossing
MPC with friends and foes

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)