Publications

Note: the order of the papers here is according to the year of the conference in which the paper was presented.

Lower Bounds for Concurrent Self Composition

2004
Y. Lindell.

In the 1st Annual Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 2951), pages 203-222, 2004. See above for the full version of this paper.

Lower Bounds and Impossibility Results for Concurrent Self Composition

2004
Y. Lindell.

In the Journal of Cryptology, 21(2):200-249, 2008. This version combines the results of the paper Lower Bounds for Concurrent Self Composition at TCC 2004 together with the lower bound from the paper Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions at STOC 2003.

Protocol Initialization for the Framework of Universal Composability

2004
B. Barak, Y. Lindell and T. Rabin.

A Proof of Security of Yao’s Protocol for Two-Party Computation

2004
Y. Lindell and B. Pinkas.

In the Journal of Cryptology, 22(2):161-188, 2009.