New imperfect random source with applications to coin-flipping

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 297-309

  Dodis, Yevgeniy ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTRACTION; RANDOM VARIABLES; COMPUTATIONAL LINGUISTICS;

ADAPTIVE ADVERSARY; ADAPTIVE THRESHOLDS; BIT-FIXING SOURCES; COIN FLIPPING PROTOCOL; INTERNAL CORRELATION; RANDOMNESS EXTRACTIONS; SECURE PROTOCOLS; STATISTICAL NOISE;

AUTOMATA THEORY;

EID: 84879512073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_25     Document Type: Conference Paper

References (15)

1. M. Ajtai, N. Linial. The influence of large coalitions. Combinatorica, 13(2):129-145, 1993.
2. N. Alon, M. Naor. Coin-flipping games immune against linear-sized coalitions. SIAM J. Comput. , 22(2):403-417, 1993.
3. N. Alon, M. Rabin. Biased Coins and Randomized Algorithms. Advances in Computing Research, 5:499-507, 1989.
4. M. Ben-Or, N. Linial. Collective Coin-Flipping. In Randomness and Computation, pp. 91-115, Academic Press, New York, 1990.
5. M. Blum. Independent unbiased coin-flipsfrom a correclated biased source-a finite state Markov chain. Combinatorica, 6(2):97-108, 1986.
6. R. Boppana, B. Narayanan. The Biased Coin Problem. SIAM J. Discrete Math. , 9(1)29-36, 1996.
7. R. Boppana, B. Narayanan. Perfect-information Leader Election with Optimal Resilience. SIAM J. Comput. , 29(4):1304-1320, 2000.
8. P. Elias. The Efficient Construction of an Unbiased Random Sequence. Ann. Math. Stat. , 43(3):865-870, 1972.
9. U. Feige. Noncryptographic Selection Protocols. In Proc. of 40th FOCS, pp. 142-152, 1999.
10. J. Kahn, G. Kalai, N. Linial. The Influence of Variables on Boolean Functions. In Proc. of 30th FOCS, pp. 68-80, 1989.
11. D. Lichtenstein, N. Linial, M. Saks. Some Extremal Problems Arising from Discrete Control Processes. Combinatorica, 9:269-287, 1989.
12. A. Russell, D. Zuckerman. Perfect information leader election in log n+ O(1) rounds. In Proc. of 39th FOCS, pp. 576-583, 1998.
13. M. Saks. A robust noncryptographic protocol for collective coin flipping. SIAM J. Discrete Math. , 2(2):240-244, 1989.
14. M. Śantha, U. Vazirani. Generating Quasi-Random Sequences from Semi-Random Sources. J. of Computer and System Sciences, 33(1):75-87, 1986.
15. J. von Newman. Various techniques used in connection with random digits. In National Bureau of Standards, Applied Math. Series, 12:36-38, 1951.