@inproceedings{cfd81453b92041cea3bf455b4269327e,
title = "On oblivious amplification of coin-tossing protocols",
abstract = "We consider the problem of amplifying two-party coin-tossing protocols: given a protocol where it is possible to bias the common output by at most ρ, we aim to obtain a new protocol where the output can be biased by at most ρ? < ρ. We rule out the existence of a natural type of amplifiers called oblivious amplifiers for every ρ? < ρ. Such amplifiers ignore the way that the underlying ρ-bias protocol works and can only invoke an oracle that provides ρ-bias bits. We provide two proofs of this impossibility. The first is by a reduction to the impossibility of deterministic randomness extraction from Santha-Vazirani sources. The second is a direct proof that is more general and also rules outs certain types of asymmetric amplification. In addition, it gives yet another proof for the Santha-Vazirani impossibility.",
keywords = "Amplification, Coin tossing, Lower bound, Santha vazirani",
author = "Nir Bitansky and Nathan Geier",
note = "Publisher Copyright: {\textcopyright} Nir Bitansky and Nathan Geier.; 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 ; Conference date: 12-01-2020 Through 14-01-2020",
year = "2020",
month = jan,
doi = "10.4230/LIPIcs.ITCS.2020.30",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Thomas Vidick",
booktitle = "11th Innovations in Theoretical Computer Science Conference, ITCS 2020",
}