[DLMM11] On the Black-Box Complexity of Optimally-Fair Coin Tossing

Authors: Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin | Venue: TCC 2011 | Source

Abstract

TODO — abstract.

BibTeX

Copy

@Inproceedings{TCC:DLMM11,
  author = {Dana {Dachman-Soled} and Yehuda Lindell and Mohammad Mahmoody and Tal Malkin},
  title = {On the Black-Box Complexity of Optimally-Fair Coin Tossing},
  pages = {450--467},
  editor = {Yuval Ishai},
  booktitle = {TCC~2011: 8th Theory of Cryptography Conference},
  volume = {6597},
  series = {Lecture Notes in Computer Science},
  address = {Providence, RI, USA},
  month = {mar~28--30},
  publisher = {Springer Berlin Heidelberg, Germany},
  year = {2011},
  doi = {10.1007/978-3-642-19571-6_27},
}