Constant-round coin-tossing with a man in the middle or realizing the shared random string model

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 345-355

  Barak, Boaz ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CRYPTOGRAPHY; PROBABILITY; SECURITY OF DATA; THEOREM PROVING;

CONSTANT-ROUND COIN-TOSSING; MAN IN THE MIDDLE SETTING; SHARED RANDOM STRING MODEL;

NETWORK PROTOCOLS;

EID: 0036949106     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. B. Barak. How to go beyond the black-box simulation barrier. In 42nd FOCS, pages 1060-115, 2001. Preliminary full version available on http://www.wisdom.weizmann.ac.il/~boaz.
2. B. Barak. Constant-round coin-tossing with a man in the middle or realizing the shared random string model. Cryptology ePrint Archive, 2002. Full version of this work. Also available on http://www.wisdom.weizmann.ac.il/~boaz.
3. B. Barak and O. Goldreich. Universal arguments and their applications. Cryptology ePrint Archive, Report 2001/105, 2001. Also posted as ECCC report TR01-093. Extended abstract to appear in CCC 2002.
4. B. Barak and Y. Lindell. Strict polynomial-time in simulation and extraction. Cryptology ePrint Archive, Report 2002/043, 2002. http://eprint.iacr.org/. Extended abstract to appear in STOC 2002.
5. M. Blum. Coin flipping by phone. In The 24th IEEE Computer Conference (CompCon), pages 133-137, 1982.
6. M. Blum. SIGACT News, Vol. 15, No. 1, 1983.
7. M. Blum, P. Feldman, and S. Micali. Non-interactive zero-knowledge and its applications (extended abstract). In Proceedings of 20th STOC, pages 103-112, 2-4 May 1988.
8. R. Canetti and M. Fischlin. Universally composable commitments. Report 2001/055, Cryptology ePrint Archieve, July 2001. Extended abstract appeared in CRYPTO 2001.
9. B. Chor and M. O. Rabin. Achieving independence in logarithmic number of rounds. In Proceedings of 6th Annual ACM Symposium on Principles of Distributed Computing, pages 260-268. ACM Press, Aug. 1987.
10. A. De Santis, G. Di Crescenzo, R. Ostrovsky, G. Persiano, and A. Sahai, Robust non-interactive zero knowledge. In CRYPTO '2001, pages 566-598, 2001.
11. A. De Santis and G. Persiano. Zero-knowledge proofs of knowledge without interaction. In 33rd FOCS, pages 427-436. IEEE Computer Society Press, 1992.
12. G. Di Crescenzo, Y. Ishai, and R. Ostrovsky. Non-interactive and non-malleable commitment. In Proceedings of the 30th STOC, pages 141-150. ACM Press, 1998.
13. G. Di Crescenzo, J. Katz, R. Ostrovsky, and A. Smith. Efficient and non-interactive non-malleable commitment. Report 2001/032, Cryptology ePrint Archive, Apr. 2001. Preliminary version in EUROCRYPT 2001.
14. D. Dolev, C. Dwork, and M. Naor. Nonmalleable cryptography. SIAM Journal on Computing, 30(2):391-437 (electronic), 2000. Preliminary version in 23rd STOC, 1991.
15. Feige, Lapidot, and Shamir. Multiple noninteractive zero knowledge proofs under general assumptions. SICOMP: SIAM Journal on Computing, 29, 1999.
16. M. Fischlin and R. Fischlin. Efficient non-malleable commitment schemes. Lecture Notes in Computer Sciences, 1880:413-430, 2000. Extended abstract in CRYPTO'2000.
17. O. Goldreich. Foundations of Cryptography: Basic Tools. Cambridge University Press, 2001.
18. O. Goldreich and H. Krawczyk. On sparse pseudorandom ensembles. Random Structures and Algorithms, 3(2):163-174, 1992.
19. O. Goldreich and Y. Lindell. Session-key generation using human passwords only. Report 2000/057, Cryptology ePrint Archive, Nov. 2000. Extended abstract in CRYPTO 2001.
20. R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th STOC, pages 220-229, 1997.
21. J. Kilian. A note on efficient zero-knowledge proofs and arguments (extended abstract). In Proceedings of the 24th STOC, pages 723-732, 1992.
22. Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. In CRYPTO '2001, pages 171-189, 2001.
23. Y. Lindell. Personal communication, April 2002.
24. S. Micali. CS proofs. In Proceedings of 35th FOCS, pages 436-453. IEEE Computer Society Press, 1994.
25. M. Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.
26. R. Richardson and J. Kilian. On the concurrent composition of zero-knowledge proofs. In EUROCRYPT: Proceedings of EUROCRYPT, 1999.
27. A. Sahai. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In Proceedings of 40th FOCS, pages 543-553, 1999.