On fair exchange, fair coins and fair sampling
From MaRDI portal
Publication:2845677
Recommendations
Cited in
(10)- On the power of an honest majority in three-party computation without broadcast
- Computational hardness of optimal fair computation: beyond Minicrypt
- Toward a game theoretic view of secure computation
- Complete characterization of fairness in secure two-party computation of Boolean functions
- Secure non-interactive reduction and spectral analysis of correlations
- Can Alice and Bob guarantee output to Carol?
- Game-theoretically fair distributed sampling
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- Stay away from fair coins: a Condorcet jury theorem
- Black-box use of one-way functions is useless for optimal fair coin-tossing
This page was built for publication: On fair exchange, fair coins and fair sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845677)