List of papers and other material covering the material in the lectures about universal composability

Birgit Pfitzmann, Michael Waidner. A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. Cryptology ePrint 2000/066. (also in IEEE Symposium on Security and Privacy, 2001)

Michael Backes, Birgit Pfitzmann, Michael Waidner. The Reactive Simulatability (RSIM) Framework for Asynchronous Systems. Cryptology ePrint 2004/082. (a more mature version of the framework)

Michael Backes, Birgit Pfitzmann, Michael Waidner. A Universally Composable Cryptographic Library. Cryptology ePrint 2003/015. (Also in ACM Conference on Computer and Communications Security, 2003)

Michael Backes, Birgit Pfitzmann, Michael Waidner. Symmetric Authentication Within a Simulatable Cryptographic Library. Cryptology ePrint 2003/145. (Also in ESORICS 2003)

Michael Backes, Birgit Pfitzmann. Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library. Cryptology ePrint 2004/059. (Also in Computer Security Foundations Workshop, 2004)

Ran Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. Cryptology ePrint 2000/067. (also in IEEE Symposium on Foundations of CS, 2001)

Ran Canetti, Tal Rabin. Universal Composition with Joint State. Cryptology ePrint 2002/047. (also in CRYPTO 2003)

Ran Canetti. Security and Composition of Cryptographic Protocols: A Tutorial. Cryptology ePrint 2006/465. (this and the previous two papers introduce the "competing", and more popular formalization of UC)

Jens Groth, Rafail Ostrovsky, Amit Sahai. Perfect Non-Interactive Zero Knowledge for NP. Cryptology ePrint 2005/290. (also in EUROCRYPT 2006). Sec. 6 is about UC NIZK.

Jens Groth. Evaluating Security of Voting Schemes in the Universal Composability Framework. Cryptology ePrint 2002/002. (also in Applied Cryptography and Network Security - ACNS 2004).

Paillier cryptosystem - the most well-known additively homomorphic encryption system.

For threshold homomorphic encryption, look at Mads Jurik's research page and the paper A Generalisation, a Simplification and some Applications of Paillier's Probabilistic Public-Key System by him and Ivan Damgård available there.