On Fair Exchange, Fair Coins and Fair Sampling

DOI10.1007/978-3-642-40041-4_15zbMath1310.94121OpenAlexW83558877MaRDI QIDQ2845677

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

Mathematics Subject Classification ID

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

Related Items (6)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Toward a game theoretic view of secure computation ⋮ Secure non-interactive reduction and spectral analysis of correlations ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ On the power of an honest majority in three-party computation without broadcast ⋮ 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