Bounded-concurrent secure two-party computation in a constant number of rounds

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 404-413

  Pass, Rafael ^a   Rosen, Alon ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CRYPTOGRAPHY; NETWORK PROTOCOLS; POLYNOMIALS; PROBABILITY;

BLACK BOX SIMULATION; CONCURRENT SETTING; SECURE TWO PARTY COMPUTATION;

COMPUTER SCIENCE;

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

References (35)

1. B. Barak. How to go Beyond the Black-Box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
2. B. Barak. Constant-Round Coin-Tossing or Realizing the Shared-Random String Model. In 43rd FOCS, pages 345-355, 2002.
3. B. Barak and O. Goldreich. Universal Arguments and their Applications. 17th CCC, pages 194-203, 2002.
4. B. Barak and Y. Lindell. Strict Polynomial-Time in Simulation and Extraction. In 34th STOC, pages 484-493, 2002.
5. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377-391, 1991. Repetition Lower the Error
6. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, 2000.
7. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 34th STOC, pages 494-503, 2002.
8. R. Canetti and M. Fischlin. Universally Composable Commitments. In Crypto2001, Springer LNCS 2139, pages 19-40, 2001.
9. R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable Zero-Knowledge. In 32nd STOC, pages 235-244, 2000.
10. R. Canetti, J. Kilian, E. Petrank and A. Rosen. Black-Box Concurrent Zero-Knowledge Requires (almost) Logarithmically Many Rounds. SIAM Jour. on Computing, Vol. 32(1), pages 1-47, 2002.
11. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. To appear in EuroCrypt2003.
12. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494-503, 2002.
13. I. Damgard. Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In EuroCrypt2000, LNCS 1807, 418-430, 2000.
14. D. Dolev, C. Dwork and M. Naor. Non-Malleable Cryptography. SIAM Jour. on Computing, Vol. 30(2), pages 391-437, 2000.
15. C. Dwork, M. Naor and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
16. C. Dwork and A. Sahai. Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In Cryto98, Springer LNCS 1462, pages 442-457, 1998.
17. U. Feige. Ph.D. thesis, Alternative Models for Zero Knowledge Interactive Proofs. Weizmann Institute of Science, 1990.
18. O. Goldreich. Draft of a Chapter on general Protocols. Available at: http://www.wisdom.weizmann.ac.il/-oded/PSBookFrag/prot.ps
19. O. Goldreich. Foundation of Cryptography - Basic Tools. Cambridge University Press, 2001.
20. O. Goldreich and H. Krawczyk. On the Composition of Zero-Knowledge Proof Systems. SIAM Jour. on Computing, Vol. 25(1), pages 169-192, 1996.
21. O. Goldreich, S. Micali and A. Wigderson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. JACM, Vol. 38(1), pp. 691-729, 1991.
22. O. Goldreich, S. Micali and A. Wigderson. How to Play any Mental Game - A Completeness Theorem for Protocols with Honest Majority. In 19th STOC, pages 218-229, 1987.
23. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO'90, Springer-Verlag (LNCS 537), pages 77-93, 1990.
24. J. Kilian and E. Petrank. Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds. In 33rd STOC, pages 560-569, 2001.
25. J. Kilian, E. Petrank and C. Rackoff. Lower Bounds for Zero-Knowledge on the Internet. In 39th FOCS, pages 484-492, 1998.
26. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. To appear in 34th STOC, 2003.
27. S. Micali. CS Proofs. SIAM Jour. on Computing, Vol. 30 (4), pages 1253-1298, 2000.
28. S. Micali and P. Rogaway. Secure computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, Springer-Verlag (LNCS 576), pages 392-404, 1991.
29. M. Naor. Bit Commitment using Pseudorandomness. Jour. of Cryptology, Vol. 4, pages 151-158, 1991.
30. R. Pass. Simulation in Quasi-polynomial Time and its Application to Protocol Composition. In EuroCrypt2003, Springer LNCS, 2656, pages 160-176, 2003.
31. R. Pass. On Deniability in the Common Reference String and Random Oracle Model. To appear in Crypto2003
32. M. Prabhkaran, A. Rosen and A. Sahai. Concurrent Zero-Knowledge with Logarithmic Round Complexity. Proceedings of the 43rd annual IEEE symposium on Foundations of Computer Science (FOCS 2002), pages 366-375 2002.
33. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EuroCrypt99, Springer LNCS 1592, pages 415-431, 1999.
34. A. Rosen. A note on the round-complexity of Concurrent Zero-Knowledge. In Crypto2000, Springer LNCS 1880, pages 451-468, 2000.
35. A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162-167, 1986.