International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

On the Black-Box Complexity of Optimally-Fair Coin Tossing

Authors:
Dana Dachman-Soled
Yehuda Lindell
Mohammad Mahmoody
Tal Malkin
Download:
DOI: 10.1007/978-3-642-19571-6_27
URL: https://www.iacr.org/archive/tcc2011/65970446/65970446.pdf
Search ePrint
Search Google
Conference: TCC 2011
BibTeX
@inproceedings{tcc-2011-23531,
  title={On the Black-Box Complexity of Optimally-Fair Coin Tossing},
  booktitle={Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={6597},
  pages={450},
  url={https://www.iacr.org/archive/tcc2011/65970446/65970446.pdf},
  doi={10.1007/978-3-642-19571-6_27},
  author={Dana Dachman-Soled and Yehuda Lindell and Mohammad Mahmoody and Tal Malkin},
  year=2011
}