C. Cachin, S. Micali, and M. Stadler, Computationally Private Information Retrieval with Polylogarithmic Communication, Lecture Notes in Computer Science, vol.1592, pp.402-414, 1999.
DOI : 10.1007/3-540-48910-X_28

R. Canetti, Security and Composition of Multiparty Cryptographic Protocols, Journal of Cryptology, vol.13, issue.1, pp.143-202, 2000.
DOI : 10.1007/s001459910006

B. Chor, E. Kushilevitz, O. Goldreich, and M. Sudan, Private information retrieval, Journal of the ACM, vol.45, issue.6, pp.965-981, 1998.
DOI : 10.1145/293347.293350

M. J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold, Keyword Search and Oblivious Pseudorandom Functions, Theory of Cryptography, pp.303-324, 2005.
DOI : 10.1007/978-3-540-30576-7_17

R. Gennaro, C. Gentry, and B. Parno, Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers, Proceedings of CRYPTO
DOI : 10.1007/978-3-642-14623-7_25

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.169-178, 2009.
DOI : 10.1145/1536414.1536440

O. Goldreich, Foundations of Cryptography: Volume II Basic Application, 2004.

O. Goldreich, S. Micali, and A. Wigderson, How to play ANY mental game, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.218-229, 1987.
DOI : 10.1145/28395.28420

O. Goldreich and R. Ostrovsky, Software protection and simulation on oblivious RAMs, Journal of the ACM, vol.43, issue.3, pp.431-473, 1996.
DOI : 10.1145/233551.233553
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.35.8989&rep=rep1&type=pdf

E. Kushilevitz and R. Ostrovsky, Replication is not needed: single database, computationally-private information retrieval, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.364-373, 1997.
DOI : 10.1109/SFCS.1997.646125

Y. Lindelll and B. Pinkas, A Proof of Security of Yao???s Protocol for Two-Party Computation, Journal of Cryptology, vol.33, issue.4, pp.161-188, 2009.
DOI : 10.1017/CBO9780511721656

D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, Fairplay?a secure two-party computation system, SSYM'04: Proceedings of the 13th conference on USENIX Security Symposium, pp.20-20, 2004.

M. Naor and B. Pinkas, Efficient oblivious transfer protocols, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp.448-457, 2001.

M. Naor, B. Pinkas, and R. Sumner, Privacy preserving auctions and mechanism design, Proceedings of the 1st ACM conference on Electronic commerce , EC '99, pp.129-139, 1999.
DOI : 10.1145/336992.337028

P. Williams, R. Sion, and B. Carbunar, Building castles out of mud, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, pp.139-148, 2008.
DOI : 10.1145/1455770.1455790

C. Andrew and . Yao, Protocols for secure computation, Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pp.160-164, 1982.

C. Andrew and . Yao, How to generate and exchange secrets, Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, pp.162-167, 1986.