all InfoSec news
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. (arXiv:2104.08820v2 [cs.CR] UPDATED)
June 20, 2022, 1:20 a.m. | Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
cs.CR updates on arXiv.org arxiv.org
In a multi-party fair coin-flipping protocol, the parties output a common
(close to) unbiased bit, even when some adversarial parties try to bias the
output. In this work we focus on the case of an arbitrary number of corrupted
parties. Cleve [STOC 1986] has shown that in any such $m$-round coin-flipping
protocol, the corrupted parties can bias the honest parties' common output bit
by $\Theta(1/m)$. For more than two decades, the best known coin-flipping
protocol was the one of Awerbuch …
More from arxiv.org / cs.CR updates on arXiv.org
Jobs in InfoSec / Cybersecurity
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Azure Security Architect
@ First Quality | Remote US - Eastern or Central Timezone
Senior Security Engineer
@ LRQA | Birmingham, GB, B37 7ES
Product Security Intern
@ Sinch | Chicago, Illinois, United States
Cyber Support Engineer
@ Darktrace | New York