Bounded-concurrent secure two-party computation without setup assumptions

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 683-692

  Lindell, Yehuda ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Theory

Indexed keywords

COMPUTATIONAL METHODS; DATA PRIVACY; MATHEMATICAL MODELS; POLYNOMIALS; SECURITY OF DATA;

TWO-PARTY PROTOCOLS;

NETWORK PROTOCOLS;

EID: 0038446804     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780637.780641     Document Type: Conference Paper

References (26)

1. B. Barak. How to go beyond the black-box simulation barrier. In 42nd FOCS, pages 106-115, 2001.
2. B. Barak and O. Goldreich. Universal Arguments and their Applications. 17th IEEE Conference on Computational Complexity, pages 194-203, 2002.
3. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377-391, 1991.
4. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
5. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136-145, 2001.
6. R. Canetti and M. Fischlin, Universally Composable Commitments. In CRYPTO'01, Springer-Verlag (LNCS 2139), pages 19-40, 2001.
7. R. Canetti, J. Kilian, E. Petrank, and A. Rosen. Black-Box Concurrent Zero-Knowledge Requires Ω̄(log n) Rounds. In 33rd STOC, pages 570-579. 2001.
8. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. In Eurocrypt, 2003.
9. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494-503, 2002.
10. D. Chaum. Blind Signatures for Untraceable Payments. In CRYPTO'88, pages 199-203, 1982.
11. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
12. S. Even, O. Goldreich and A. Lempel. A randomized protocol for signing contracts. In Communications of the ACM, 28(6):637-647, 1985.
13. J. Garay and P. Mackenzie. Concurrent Oblivious Transfer. In 41st FOCS, pages 314-324, 2000.
14. O. Goldreich, S. Goldwasser and S. Micali. How to Construct Random Functions. Journal of the ACM, 33(4):792-807, 1986.
15. 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.
16. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO'90, pages 77-93, 1990.
17. S. Goldwasser, S. Micali, and R.L. Rivest. A digital signature scheme secure against adaptive chosen- message attacks. SICOMP, 17(2):281-308, 1988.
18. R. Impagliazzo and M. Luby. One-way Functions are Essential for Complexity Based Cryptography. In 30th FOCS, pages 230-235, 1989.
19. J. Kilian and E. Petrank. Concurrent and resettable zero-knowledge in poly-logartihmic rounds. In 33rd STOC, pages 560-569, 2001.
20. J. Kilian, E. Petrank and C. Rackoff. Lower Bounds for Zero Knowledge on the Internet. In 39th FOCS, pages 484-492, 1998.
21. S. Micali and P. Rogaway. Secure computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, pages 392-404, 1991.
22. M. Prabhakaran, A. Rosen and A. Sahai. Concurrent Zero Knowledge With Logarithmic Round Complexity. In 43rd FOCS, pages 366-375, 2002.
23. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In Eurocrypt'99, pages 415-413, 1999.
24. J. Rompel. One-Way Functions are Necessary and Sufficient for Secure Signatures. In 22nd STOC, pages 387-394, 1990.
25. A. Rosen. A Note on the Round-Complexity of Concurrent Zero-Knowledge. In CRYPTO 2000, Springer-Verlag (LNCS 1880), pages 451-468, 2000.
26. A. Yao. How to Generate and Exchange Secrets. In 27th FOCS, pages 162-167, 1986.