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

• Type: Conference
• Year: 2005
• Where: STOC
• Authors: Saurabh Sanghvi, Salil P. Vadhan
• Keywords: Algorithms, Output’s Statistical Difference, STOC 2005, Two-party Protocols, Unlimited Computational Resources