Abstract
We consider protocols for two parties to select a random string of a given length n. We are interested in protocols in which the resulting distribution is close to the uniform one even if one party deviates from the protocol. For 2 and 3 round protocols we prove tight upper bounds for the Shannon entropy that such protocols can guarantee for the honest party. We also prove some upper bound for r round protocols for every r.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. SIAM Journ. on Computing 27(2), 506–544 (1998)
Sanghvi, S., Vadhan, S.: The Round Complexity of Two-Party Random Selection. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing. Baltimore, MD, USA, pp. 338–347
Buhrman, H., Christandl, M., Koucký, M., Lotker, Z., Patt-Shamir, B., Vereshchagin, N.K.: High Entropy Random Selection Protocols. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 366–379. Springer, Heidelberg (2007)
Schwalbe, U., Walker, P.: Zermelo and the Early History of Game Theory. Games and Economic Behavior 34(1), 123–137 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stepanov, T. (2013). Random Selection in Few Rounds. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-38536-0_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38535-3
Online ISBN: 978-3-642-38536-0
eBook Packages: Computer ScienceComputer Science (R0)