On the classification of finite Boolean functions up to fairness
From MaRDI portal
Recommendations
- Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
- 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
Cited in
(19)- Black-box use of one-way functions is useless for optimal fair coin-tossing
- MPC with friends and foes
- Computational hardness of optimal fair computation: beyond Minicrypt
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- On fully secure MPC with solitary output
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Tighter bounds on multiparty coin flipping via augmented weak martingales and differentially private sampling
- Towards characterizing complete fairness in secure two-party computation
- On perfectly secure 2PC in the OT-hybrid model
- On perfectly secure 2PC in the OT-hybrid model
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- On the power of an honest majority in three-party computation without broadcast
- On secure computation of solitary output functionalities with and without broadcast
- Three party secure computation with friends and foes
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Can Alice and Bob guarantee output to Carol?
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
This page was built for publication: On the classification of finite Boolean functions up to fairness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2922657)
