1. Lecture Notes in Computer Science;G. Asharov,2013
2. Lecture Notes in Computer Science;A. Beimel,2011
3. Lecture Notes in Computer Science;A. Beimel,2010
4. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067 (2005) (revised version of [?]. 7)
5. Cheeger, J.: A lower bound for the smallest eigenvalue of the laplacian. Problems in analysis 625, 195–199 (1970)