Lower bounds for concurrent self composition

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

Volumn 2951, Issue , 2004, Pages 203-222

  Lindell, Yehuda ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

COMMUNICATION COMPLEXITY; CONCURRENT EXECUTION; IMPOSSIBILITY RESULTS; LOWER BOUNDS; SECURE PROTOCOLS; SET-UP PHASE; STRINGENT REQUIREMENT;

ARTIFICIAL INTELLIGENCE;

EID: 35048903637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_12     Document Type: Article

References (21)

1. B. Barak. How to Go Beyond the Black-Box Simulation Barrier. In 42nd FOCS, pages 106-115, 2001.
2. D. Beaver. Foundations of Secure Interactive Computing. In CRYPTO'91, Springer-Verlag (LNCS 576), pages 377-391, 1991.
3. R. Canetti. Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology, 13(1):143-202, 2000.
4. R, Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In 42nd FOCS, pages 136-145, 2001.
5. R. Canetti and M. Fischlin. Universally Composable Commitments. In CRYPTO'01, Springer-Verlag (LNCS 2139), pages 19-40, 2001.
6. R. Canetti, J. Kilian, E. Petrank, and A. Rosen. Black-Box Concurrent ZeroKnowledge Requires Ω(log n) Rounds. In 33rd STOC, pages 570-579, 2001.
7. R. Canetti, E. Kushilevitz and Y. Lindell. On the Limitations of Universal Composition Without Set-Up Assumptions. In EUROCRYPT'03, Springer-Verlag (LNCS 2656), pages 68-86, 2003.
8. R. Canetti, Y. Lindell, R. Ostrovsky and A. Sahai. Universally Composable Two-Party and Multi-Party Computation. In 34th STOC, pages 494-503, 2002.
9. C. Dwork, M. Naor, and A. Sahai. Concurrent Zero-Knowledge. In 30th STOC, pages 409-418, 1998.
10. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416-426, 1990.
11. 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.
12. S. Goldwasser and L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In CRYPTO'90, Springer-Verlag (LNCS 537), 1990.
13. J. Kelsey, B. Schneier and D. Wagner. Protocol Interactions and the Chosen Protocol Attack. In 5th International Workshop on Security Protocols, SpringerVerlag (LNCS 1361), pages 91-104, 1997.
14. Y. Lindell. Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. In 35th STOC, pages 683-692, 2003. (See [15] for a full version of the upper bound from this paper.)
15. Y. Lindell. Protocols for Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions. Cryptology ePrint Archive, Report #2003/100, http://eprint.iacr.org/2003/100.
16. Y. Lindell. General Composition and Universal Composability in Secure MultiParty Computation. In 44th FOCS, pages 394-403, 2003.
17. S. Micali and P. Rogaway. Secure Computation. Unpublished manuscript, 1992. Preliminary version in CRYPTO'91, Springer-Verlag (LNCS 576), 1991.
18. R. Pass and A. Rosen Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In 44th FOCS, 2003.
19. B. Pfitzmann and M. Waidner. Composition and Integrity Preservation of Secure Reactive Systems. In 7th CCS, pages 245-254, 2000.
20. R. Richardson and J. Kilian. On the Concurrent Composition of Zero-Knowledge Proofs. In EUROCRYPT'99, Springer-Verlag (LNCS 1592), pp. 415-431, 1999.
21. A. Yao. How to Generate and Exchange Secrets. 27th FOCS, pp. 162-167, 1986.