Ravi B. Boppana
- 1.N. Alon and M. Naor (1990), "Coin-Flipping Games Immune Against Linear-Sized Coalitions", Proceedings of the 31st Annual IEEE Symposium on Foundalions of Computer Science, pages 46-54. journal version to appear in the SIAM Journal on Computing. Google Scholar
Digital Library
- 2.N. Alon and M.O. Rabin (1989), "Biased Coins and Randomized Algorithms", Advances zn Computing Research 5, Edited by S. Micali, pages 499-507, JAI Press Inc., Greenwieh, Connecticut.Google Scholar
- 3.M. Ben-Or and N. Linial (1989), "Collective Coin Flipping", Advances in Computing Research 5, Edited by S. Micali, pages 91-116, JAI Press Inc., Greenwich, Connecticut.Google Scholar
- 4.M. Ben-Or, N. Linial, and M. Saks (1987), "Collective Coin Flipping and Other Models of Imperfect Randomness", Proceedzngs of the 7th Hungarian Conference on Comznatorics, Colloquza Mathematica Soczelatis Jdnos Bolyaz 52, pages 77-112, North-Holland Publishing Company, Amsterdam.Google Scholar
- 5.B. Chor and O. GoIdreich (1988), "Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity", SIAM Journal on Computing 17:2, pages 230-261. Google ScholarDigital Library
- 6.J. Cooper and N. Linial (1993), "Fast Perfect- Information Leader-Election Protocol with Linear Immunity", Proceedings of the 25#h Annual ACM Symposium on Theory of Computing. Google ScholarDigital Library
- 7.G.H. Hardy, :I.E. Littlewood, and G. P61ya (1952), Inequalities (Second Edition), Cambridge University Press, Cambridge.Google Scholar
- 8.H.F. Murry (1970), "A General Approach for Generating Natural Random Variables", IEEE Transactions on Computers C-19, pages 1210-1213.Google ScholarDigital Library
- 9.M. Saks (1989), "A Robust Noncryptographic Protocol for Collective Coin Flipping", SIAM Journal on Discrete Mathematics 2:2, pages 240-244. Google ScholarDigital Library
- 10.M. Santha and U.V. Vazirani (1986), "Generating Quasi-Random Sequences from Semi- Random Sources", Journal of Computer and System Sczences 33:1, pages 75-87. Google ScholarDigital Library
- 11.E. Shamir (1988), "A Slightly Random Source Confronts a Random Witness-Set", Technical Report CS-87-9d, Leibniz Center for Research in Computer Science, Hebrew University, Jerusalem.Google Scholar
- 12.U.V. Vazirani (1987), "Strong Communication Complexity or Generating Quasi-Random Sequences from Two Communicating Semi# Random Sources", Combznatorica 7:4, pages 375-392. Google ScholarDigital Library
- 13.U.V. Vazirani and V.V. Vazirani (1985), "Random Polynomial Time is Equal to Slightly- Random Polynomial Time", Proceedzngs of the 25th Annual IEEE Symposzum o, Foundations of Computer Science, pages 417-428.Google Scholar
- 14.D. Zuckerman (1991), "Simulating BPP Using a General Weak Random Source," Proceedings of the 32nd Annual IEEE Symposium on Foundatio,s of Computer Science, pages 79- 89. Google ScholarDigital Library
Index Terms
- The biased coin problem
Recommendations
Smartcard-Based e-Coin for Electronic Payments on the (Mobile) Internet
SITIS '07: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based SystemNowadays e-purses are not being offered as payment method on the Internet. This is mainly due to the fact that vendors have to integrate in their devices a security application module (SAM) to exchange security messages between the e-purse and that ...
Pinocchio coin: building zerocoin from a succinct pairing-based proof system
PETShop '13: Proceedings of the First ACM workshop on Language support for privacy-enhancing technologiesBitcoin is the first widely adopted distributed e-cash system and Zerocoin is a recent proposal to extend Bitcoin with anonymous transactions. The original Zerocoin protocol relies heavily on the Strong RSA assumption and double-discrete logarithm ...
Von Neumann's Biased Coin Revisited
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer ScienceSuppose you want to generate a random sequence of zeros and ones and all you have at your disposal is a coin which you suspect to be biased (but do not know the bias). Can "perfect" randomness be produced with this coin? The answer is positive, thanks ...
Comments