Abstract
Alice seeks an information-theoretically secure source of private random data. Unfortunately, she lacks a personal source and must use remote sources controlled by other parties. Alice wants to simulate a coin flip of specified bias α, as a function of data she receives from p sources; she seeks privacy from any coalition of r of them. We show: If p/2 ≤ r < p, the bias can be any rational number and nothing else; if 0 < r < p/2, the bias can be any algebraic number and nothing else. The proof uses projective varieties, convex geometry, and the probabilistic method. Our results improve on those laid out by Yao, who asserts one direction of the r = 1 case in his seminal paper [yao82]. We also provide an application to secure multiparty computation.
Chapter PDF
Similar content being viewed by others
Keywords
References
Cayley, A.: On the theory of linear transformations. Cambridge Math. J. 4 (1845)
Davenport, H.: Simultaneous Diophantine approximation. In: Proc. of ICM, vol. 3, pp. 9–12 (1954)
Gelfand, I.M., Kapranov, M.M., Zelevinsky, A.V.: Discriminants, Resultants and Multidimensional Determinants. Birkhäuser (1994)
Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Proc. of ACM Symp. on TOC (1982)
Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proc. of ACM Symp. on TOC, pp. 218–229. ACM Press (1987)
Harris, J.: Algebraic Geomerty: A First Course. Springer (1992)
Lagarias, J.C.: Best simultaneously Diophantine approximations. I. growth rates of best approximation denominators. Trans. of AMS 272(2), 545–554 (1982)
Lind, D.A.: The entropies of topological Markov shifts and a related class of algebraic integers. Ergodic Theory Dynam. Systems 4(2), 283–300 (1984)
Lipton, R.J., Markakis, E.: Nash equilibria Via polynomial equations. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 413–422. Springer, Heidelberg (2004)
Mumford, D.: Algebraic Geometry I: Complex Projective Varieties. Springer (1995)
Nogueira, A., Sevennec, B.: Multidimensional farey partitions. Indag. Mathem. 17(3), 437–456 (2006)
Rokhlin, V.A.: On the fundamental ideas of measure theory. Mat. Sbornik N.S. 25(67), 107–150 (1949)
Shamir, A.: How to share a secret. CACM 22(11), 612–613 (1979)
Yao, A.C.: Protocols for secure computations (extended abstract). In: Proc. of FOCS, pp. 160–164 (November 1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 International Association for Cryptologic Research
About this paper
Cite this paper
Kopp, G.S., Wiltshire-Gordon, J.D. (2012). Robust Coin Flipping. In: Pointcheval, D., Johansson, T. (eds) Advances in Cryptology – EUROCRYPT 2012. EUROCRYPT 2012. Lecture Notes in Computer Science, vol 7237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29011-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-29011-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29010-7
Online ISBN: 978-3-642-29011-4
eBook Packages: Computer ScienceComputer Science (R0)