Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Comput. 38, pp. 523-550 (28 pages)
The Round Complexity of Two-Party Random Selection
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookWe study the round complexity of two-party protocols for generating a random $n$-bit string such that the output is guaranteed to have bounded “bias,” even if one of the two parties deviates from the protocol (possibly using unlimited computational resources). Specifically, we require that the output's statistical difference from the uniform distribution on $\{0,1\}^n$ is bounded by a constant less than 1. We present a protocol for the above problem that has $2 \log^* n + O(1)$ rounds, improving a previous $2n$-round protocol of Goldreich, Goldwasser, and Linial (FOCS '91). Like the GGL Protocol, our protocol actually provides a stronger guarantee, ensuring that the output lands in any set $T \subseteq \{0,1\}^n$ of density $\mu$ with probability at most $O(\sqrt{\mu + \delta})$, where $\delta$ may be an arbitrarily small constant. We then prove a nearly matching lower bound, showing that any protocol guaranteeing bounded statistical difference requires at least $\log^* n - \log^* \log^* n - O(1)$ rounds. We also prove several results for the case when the output's bias is measured by the maximum multiplicative factor by which a party can increase the probability of a set $T \subseteq \{0,1\}^n$.
© 2008 Society for Industrial and Applied Mathematics
RELATED DATABASES
To view database links for this article,
you need to log in.
KEYWORDS
PUBLICATION DATA
ARTICLE DATA
History
Received October 02, 2005
Accepted October 03, 2006
Published online May 23, 2008
Accepted October 03, 2006
Published online May 23, 2008
Permalink
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar