Sciweavers

Share
STOC
2005
ACM

The round complexity of two-party random selection

9 years 7 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even if one of the two parties deviates from the protocol (even using unlimited computational resources). Specifically, we require that the output’s statistical difference from the uniform distribution on {0, 1}n
Saurabh Sanghvi, Salil P. Vadhan
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where STOC
Authors Saurabh Sanghvi, Salil P. Vadhan
Comments (0)
books