Abstract
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high entropy, even when one of the two parties is dishonest and deviates from the protocol. We develop protocols that achieve high, close to n, entropy.
In the literature the randomness guarantee is usually expressed as being close to the uniform distribution or in terms of resiliency. The notion of entropy is not directly comparable to that of resiliency, but we establish a connection between the two that allows us to compare our protocols with the existing ones.
We construct an explicit protocol that yields entropy n − O(1) and has 4log* n rounds, improving over the protocol of Goldreich et al. [3] that also achieves this entropy but needs O(n) rounds. Both these protocols need O(n 2) bits of communication.
Next we reduce the communication in our protocols. We show the existence, non-explicitly, of a protocol that has 6 rounds, 2n + 8logn bits of communication and yields entropy n − O(logn) and min-entropy n/2 − O(logn). Our protocol achieves the same entropy bound as the recent, also non-explicit, protocol of Gradwohl et al. [4], however achieves much higher min-entropy: n/2 − O(logn) versus O(logn).
Finally we exhibit very simple explicit protocols. We connect the security parameter of these geometric protocols with the well studied Kakeya problem motivated by harmonic analysis and analytical number theory. We are only able to prove that these protocols have entropy 3n/4 but still n/2 − O(logn) min-entropy. Therefore they do not perform as well with respect to the explicit constructions of Gradwohl et al. [4] entropy-wise, but still have much better min-entropy. We conjecture that these simple protocols achieve n − o(n) entropy. Our geometric construction and its relation to the Kakeya problem follows a new and different approach to the random selection problem than any of the previously known protocols.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Spencer, J.: The probabilistic method, 2nd edn. John Wiley & sons, Chichester (2000)
Ambainis, A., Buhrman, H., Dodis, Y., Röhrig, H.: Multiparty Quantum Coin Flipping. In: IEEE Conference on Computational Complexity 2004, pp. 250–259 (2004)
Goldreich, O., Goldwasser, S., Linial, N.: Fault-tolerant computation in the full information model. SIAM Journ. on Computing 27(2), 506–544 (1998)
Gradwohl, R., Vadhan, S., Zuckerman, D.: Random selection with an Adversarial Majority. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 409–426. Springer, Heidelberg (2006)
Mockenhaupt, G., Tao, T.: Restriction and Kakeya phenomena for finite fields. Duke Math. J. 121, 35–74 (2004)
Wolff, T.: Recent work connected with the Kakeya problem, in Prospects. In: Rossi, H. (ed.) Mathematics. AMS (1999)
Muchnik, A., Vereshchagin, N.: Shannon Entropy vs. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds.) CSR 2006. LNCS, vol. 3967, pp. 281–291. Springer, Heidelberg (2006)
Sanghvi, S., Vadhan, S.: The Round Complexity of Two-Party Random Selection. In: Proceedings of Thirty-seventh Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, pp. 338–347
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buhrman, H., Christandl, M., Koucký, M., Lotker, Z., Patt-Shamir, B., Vereshchagin, N. (2007). High Entropy Random Selection Protocols. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2007 2007. Lecture Notes in Computer Science, vol 4627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74208-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-74208-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74207-4
Online ISBN: 978-3-540-74208-1
eBook Packages: Computer ScienceComputer Science (R0)