In the 10th Privacy Enhancing Technologies Symposium (PETS), 2010. The conference version of this paper contained a serious error which is fixed in this draft of the full version
Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs.
Author: Katz J, Lindell Y
In the Journal of Cryptology, 21(3):303-349, 2008. An extended abstract appeared in the 2nd Annual Theory of Cryptography Conference (TCC), Springer-Verlag (LNCS 3378), pages 128-149, 2005.
Lower Bounds and Impossibility Results for Concurrent Self Composition
Author: Lindell Y
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.
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.