On the limitations of universally composable two-party computation without set-up assumptions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2656, Issue , 2003, Pages 68-86

  Canetti, Ran ^a   Kushilevitz, Eyal ^b   Lindell, Yehuda ^a  

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

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

COMMON REFERENCE STRING MODELS; CRYPTOGRAPHIC PROTOCOLS; DETERMINISTIC FUNCTIONS; EXECUTION ENVIRONMENTS; PROBABILISTIC FUNCTIONS; TWO-PARTY COMPUTATION; UNIVERSALLY COMPOSABLE; UNIVERSALLY COMPOSABLE SECURITY;

COMPUTATION THEORY;

EID: 35248854495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_5     Document Type: Article

References (28)

1. D. Beaver. Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority. Journal of Cryptology, 4(2):75-122, 1991.
2. D. Beaver. Adaptive Zero-Knowledge and Computational Equivocation. In 28th STOC, pages 629-638, 1996.
3. A. Beimel, T. Malkin and S. Micali. The All-or-Nothing Nature of Two-Party Secure Computation. In CRYPTO'99, Springer-Verlag (LNCS 1666), pages 80-97, 1999.
4. M. Ben-Or, S. Goldwasser and A. Wigderson. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In 20th STOC, pages 1-10, 1988.
5. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136-145, 2001. Full version available at http://eprint.iacr.org/2000/067.
6. R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively Secure Multi-Party Computation. In 28th STOC, pages 639-648, 1996.
7. R. Canetti and M. Fischlin. Universally Composable Commitments. In CRYPTO 2001, Springer-Verlag (LNCS 2139), pages 19-40, 2001.
8. R. Canetti and H. Krawczyk. Analysis of Key Exchange Protocols and Their Use for Building Secure Channels. In Eurocrypt 2001, Springer-Verlag (LNCS 2045), pages 453-474, 2001.
9. R. Canetti and H. Krawczyk. Universally composable key exchange and secure channels. In Eurocrypt 2002, Springer-Verlag (LNCS 2332), pages 337-351, 2002.
10. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions (full version). Cryptology ePrint Archive, http://eprint.iacr.org/, 2003.
11. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494-503, 2002.
12. B. Chor, and E. Kushilevitz. A Zero-One Law for Boolean Privacy. In 21st STOC, pages 62-72, 1989.
13. R. Cleve. Limits on the security of coin-flips when half the processors are faulty. In 18th STOC, pages 364-369, 1986.
14. D. Dolev, C. Dwork and M. Naor. Non-malleable cryptography. SIAM Journal of Computing, 30(2):391-437, 2000.
15. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
16. J. Garay and P. Mackenzie. Concurrent Oblivious Transfer. In 41st FOCS, pages 314-324, 2000.
17. O. Goldreich and H. Krawczyk. On the composition of zero-knowledge proof systems. SIAM Journal of Computing, 25(1):169-192, 1996.
18. 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.
19. 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.
20. D. Hofheinz, J. Müller-Quade and R. Steinwandt. On Modeling IND-CCA Security in Cryptographic Protocols. Cryptology ePrint Archive, Report 2003/024, http://eprint.iacr.org/, 2003.
21. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and Completeness in Private Computations. SICOMP, 29(4):1189-1208, 2000.
22. J. Kilian. More general completeness theorems for secure two-party computation. In 32nd STOC, pages 316-324, 2000.
23. E. Kushilevitz. Privacy and Communication Complexity. In 30th FOCS, pages 416-421, 1989.
24. S. Micali and P. Rogaway. Secure computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, Springer-Verlag (LNCS 576), pages 392-404, 1991.
25. M. Naor and M. Yung. Public key cryptosystems provably secure against chosen ciphertext attacks. In 22nd STOC, 427-437, 1990.
26. T. Rabin and M. Ben-Or. Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. In 21st STOC, pages 73-85, 1989.
27. C. Rackoff and D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 433-444, 1991.
28. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In Eurocrypt'99, Springer-Verlag (LNCS 1592), pages 415-431, 1999.