The round complexity of two-party random selection

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 338-347

  Sanghvi, Saurabh ^a   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Coin flipping; Cryptography; Distributed computing

Indexed keywords

COIN-FLIPPING; DISTRIBUTED COMPUTING; RANDOM SELECTION PROTOCOLS;

COMPUTATIONAL METHODS; CONSTRAINT THEORY; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES; STATISTICAL METHODS;

COMPUTATIONAL COMPLEXITY;

EID: 34748826144     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060641     Document Type: Conference Paper

References (22)

1. N. Alon and M. Naor. Coin-flipping games immune against linear-sized coalitions. In Proc. 31st FOCS, 1990.
2. M. Ben-Or and N. Linial. Collective coin-flipping. Randomness and Computation, S. Micali ed., Academic Press, New York, 1989.
3. M. Blum. Coin flipping by telephone. In IEEE Spring COMPCOM, 1982.
4. R. Boppana and B. Narayanan. Perfect information leader election with optimal resilience. SIAM J. Computing 29(4), 1998.
5. C. Cachin, C. Crepeau, and J. Marcil. Oblivious transfer with a memory-bounded receiver. In Proc. 39th FOCS, 1998.
6. I. Damgard. Interactive hashing can simplify zero-knowledge protocol design. In Proc. CRYPTO '95, Springer LNCS 403, 1994.
7. I. Damgard, O. Goldreich, and A. Wigderson. Hashing functions can simplify zero-knowledge protocol design (too). TR RS-94-39. BRICS, 1994.
8. Y. Ding. D. Harnik, A. Rosen, and R. Shaltiel. Constant-round oblivious transfer in the bounded storage model. In Proc. 1st TCC, Springer LNCS 2951, 2004.
9. U. Feige. Noncryptographic selection protocols. In Proc. 40th FOCS, 1999.
10. O. Goldreich and S. Goldwasser and N. Linial. Fault-tolerant computation in the full information model. SIAM J. Computing 27(2), 1998.
11. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38(1), 1991.
12. O. Goldreich, A. Sahai, and S. Vadhan. Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In Proc. 30th STOC, 1998.
13. J. Katz and R. Ostrovsky. Round-optimal secure two-party computation. In Proc. CRYPTO '04. Springer LNCS 3152, 2004.
14. C. Lautemann. BPP and the polynomial hierarchy. IPL 14, 1983.
15. Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. In Proc. CRYPTO '01. Springer LNCS, 2001.
16. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP can be based on general complexity assumptions. J. Cryptology 11, 1998.
17. R. Ostrovsky, S. Rajagopalan, U. Vazirani. Simple and efficient leader election in the full information model. In Proc. 26th STOC, 1994.
18. A. Russell, M. Saks, and D. Zuckerman. Lower bounds for leader election and collective coin-flipping in the perfect information model. In Proc. 31st STOC, 1999.
19. A. Russell and D. Zuckerman. Perfect information leader election in log* n + O(1) rounds. In Proc. 39th FOCS, 1998.
20. M. Saks. A robust noncryptographic protocol for collective coin-flipping. SIAM J. Discrete Math, 1989.
21. S. Sanghvi. A study of two-party random selection protocols. Undergraduate Thesis. Harvard University, 2004.
22. A. Yao. How to generate and exchange secrets. In Proc. 27th FOCS, 1986.