On fair exchange, fair coins and fair sampling

DOI10.1007/978-3-642-40041-4_15zbMATH Open1310.94121OpenAlexW83558877MaRDI QIDQ2845677FDOQ2845677

Authors: Shashank Agrawal, Manoj Prabhakaran 

Publication date: 2 September 2013

Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_15

Recommendations

• A full characterization of functions that imply fair coin tossing and ramifications to fairness
• On the complexity of fair coin flipping
• Complete fairness in secure two-party computation
• Complete fairness in secure two-party computation
• On the Black-Box Complexity of Optimally-Fair Coin Tossing

Mathematics Subject Classification ID

Statistical decision theory (62C99) Cryptography (94A60) Limit theorems in probability theory (60F99)

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)