Advertisement

Random Selection in Few Rounds

  • Timofey Stepanov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7913)

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.

Keywords

Cryptography distributed computing random selection protocols 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. SIAM Journ. on Computing 27(2), 506–544 (1998)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    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–347Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Schwalbe, U., Walker, P.: Zermelo and the Early History of Game Theory. Games and Economic Behavior 34(1), 123–137 (2001)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Timofey Stepanov
    • 1
    • 2
  1. 1.Lomonosov Moscow State UniversityMoscowRussia
  2. 2.YandexMoscowRussia

Personalised recommendations