Parallel coin-tossing and constant-round secure two-party computation

Journal of Cryptology

Volumn 16, Issue 3, 2003, Pages 143-184

  Lindell, Yehuda ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Coin tossing; Constant round protocols; Secure computation

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; POLYNOMIALS;

COIN-TOSSING; CONSANT ROUND PROTOCOLS; PROTOCOL SPECIFICATION; TWO-PARTY COMPUTATION;

NETWORK PROTOCOLS;

EID: 4544235438     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-002-0143-7     Document Type: Article

References (33)

1. B. Barak. How to Go Beyond the Black-Box Simulation Barrier. In Proc. 42nd. FOCS, pages 106-115, 2001.
2. B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation and Extraction. In Proc. 34th STOC, pages 484-493, 2002.
3. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag, Berlin (LNCS 576), pages 377-391, 1991.
4. D. Beaver and S. Goldwasser. Multiparty Computation with Fault Majority. In CRYPTO'89, Springer-Verlag, Berlin (LNCS 435), pages 589-590, 1989.
5. D. Beaver, S. Micali and P. Rogaway. The Round Complexity of Secure Protocols. In Proc. 22nd STOC, pages 503-513, 1990.
6. M. Bellare. A Note on Negligible Functions. Journal of Cryptology, 15(4):271-284, 2002.
7. M. Bellare and O. Goldreich. On Defining Proofs of Knowledge. In CRYPTO'92, Springer-Verlag, Berlin (LNCS 740), pages 390-420, 1992.
8. M. Blum. Coin Flipping by Phone. In Proc. IEEE Spring COMPCOM, pages 133-137, February 1982.
9. D. Boneh and M. Franklin. Efficient Generation of Shared RSA Keys. In CRYPTO'97, Springer-Verlag, Berlin (LNCS 1233), pages 425-439, 1997.
10. G. Brassard, C. Crepeau and M. Yung. Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. Theoretical Computer Science, 84(1):23-52, 1991.
11. R. Canetti. Security and Composition of Multi-Party Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, 2000.
12. B. Chor, O. Goldreich, E. Kushilevitz and M. Sudan. Private Information Retrieval. In Proc. 36th FOCS, pp. 41-50, 1995.
13. I. Damgard, T. Pederson and B. Pfitzmann. On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures. In CRYPTO'93, Springer-Verlag, Berlin (LNCS 773), pages 250-265, 1993.
14. S. Even, O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. Communications of the ACM, 28:637-647, 1985.
15. R. Fagin, M. Naor and P. Winkler. Comparing Information without Leaking It. Communications of the ACM, 39:77-85, 1996.
16. U. Feige. Alternative Models for Zero Knowledge Interactive Proofs. Ph.D. Thesis, Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, 1990. Available from http://www.wisdom.weizmann.ac.il/~feige.
17. U. Feige and A. Shamir. Zero-Knowledge Proofs of Knowledge in Two Rounds. In CRYPTO'89, Springer-Verlag, Berlin (LNCS 435), pages 526-544, 1989.
18. O. Goldreich. Secure Multi-Party Computation. Manuscript. Preliminary version, 1998. Available from http://www.wisdom.weizmann.ac.il/~cded/pp.html.
19. O. Goldreich. Foundations of Cryptography, Volume 1. Cambridge University Press, Cambridge, 2001.
20. O. Goldreich and A. Kahan. How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. Journal of Cryptology, 9(3):167-189, 1996.
21. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing, 25(1):169-192, 1996.
22. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO'90, Spring-Verlag, Berlin (LNCS 537), pages 77-93, 1990.
23. S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SICOMP, 18(1):186-208, 1989.
24. O. Goldreich, S. Micali and A. Wigderson. How to Play Any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In Proc. 19th STOC, pages 218-229, 1987. For details see [18].
25. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM, 38(1):691-729, 1991.
26. S. Halevi and S. Micali. More on Proofs of Knowledge. Cryptology ePrint Archive, 1998/015, 1998.
27. S. Micali and P. Rogaway. Secure Computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, Springer-Verlag, Berlin (LNCS 576), pages 392-404, 1991.
28. M. Naor. Bit Commitment Using Pseudorandom Generators. Journal of Cryptology, 4(2):151-158, 1991.
29. M. Naor and K. Nissim. Communication Preserving Protocols for Secure Function Evaluation. In Proc. 33rd STOC, pages 590-599, 2001.
30. M. Naor, R. Ostrovsky, R. Venkatesan and M. Yung. Zero-Knowledge Arguments for NP Can Be Based on General Assumptions. Journal of Cryptology, 11(2):87-108, 1998.
31. M. Naor and B. Pinkas. Oblivious Transfer and Polynomial Evaluation. In Proc. 31st STOC, pages 245-254, 1999.
32. M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. In Proc. 21st STOC, pages 33-43, 1989.
33. A.C. Yao. How to Generate and Exchange Secrets. In Proc. 21th FOCS, pages 162-167, 1986.