M. Atallah, F. Kerschbaum, and W. Du, Secure and private sequence comparisons, Proceeding of the ACM workshop on Privacy in the electronic society , WPES '03, pp.39-44, 2003.
DOI : 10.1145/1005140.1005147

S. Jha, L. Kruger, and V. Shmatikov, Towards Practical Privacy for Genomic Computation, 2008 IEEE Symposium on Security and Privacy (sp 2008), pp.216-230, 2008.
DOI : 10.1109/SP.2008.34

J. Troncoso-pastoriza, S. Katzenbeisser, and M. Celik, Privacy preserving error resilient dna searching through oblivious automata, Proceedings of the 14th ACM conference on Computer and communications security , CCS '07, pp.519-528, 2007.
DOI : 10.1145/1315245.1315309

K. Frikken, Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation, In: DBSec, vol.45, issue.6, pp.81-94, 2009.
DOI : 10.1007/3-540-48910-X_16

F. Bruekers, S. Katzenbeisser, K. Kursawe, and P. Tuyls, Privacy-preserving matching of DNA profiles, ePrint Cryptology Archive Report, vol.203, 2008.

R. Wang, X. Wang, Z. Li, H. Tang, M. Reiter et al., Privacy-preserving genomic computation through program specialization, Proceedings of the 16th ACM conference on Computer and communications security, CCS '09, pp.338-347, 2009.
DOI : 10.1145/1653662.1653703
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.1425

M. Atallah and J. Li, Secure outsourcing of sequence comparisons, In: PET, pp.63-78, 2004.

M. Atallah and J. Li, Secure outsourcing of sequence comparisons, International Journal of Information Security, vol.23, issue.4, pp.277-287, 2005.
DOI : 10.1007/s10207-005-0070-3

M. Blanton and M. Aliasgari, Secure Outsourcing of DNA Searching via Finite Automata, 2010.
DOI : 10.1007/978-3-642-13739-6_4
URL : https://hal.archives-ouvertes.fr/hal-01056669

D. Szajda, M. Pohl, J. Owen, and B. Lawson, Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm, In: NDSS, 2006.

M. Kantarcioglu, W. Jiang, Y. Liu, and B. Malin, A Cryptographic Approach to Securely Share and Query Genomic Sequences, IEEE Transactions on Information Technology in Biomedicine, vol.12, issue.5, pp.606-617, 2008.
DOI : 10.1109/TITB.2007.908465

M. Franklin, M. Gondree, and P. , Mohassel: Communication-efficient private protocols for longest common subsequence, In: RSA, pp.265-278, 2009.

M. Gondree and P. Mohassel, Longest common subsequence as private search, Proceedings of the 8th ACM workshop on Privacy in the electronic society, WPES '09, pp.81-90, 2009.
DOI : 10.1145/1655188.1655200
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.6388

M. Naor and B. Pinkas, Efficient oblivious transfer protocols, In: SODA, pp.448-457, 2001.

H. Lipmaa, An Oblivious Transfer Protocol with Log-Squared Communication, In: Information Security. LNCS, vol.3650, pp.314-328, 2005.
DOI : 10.1007/11556992_23

C. Gentry and Z. Ramzan, Single-Database Private Information Retrieval with Constant Communication Rate, In: ICALP, pp.803-815, 2005.
DOI : 10.1007/11523468_65

M. Naor and B. Pinkas, Oblivious transfer and polynomial evaluation, Proceedings of the thirty-first annual ACM symposium on Theory of computing , STOC '99, 1999.
DOI : 10.1145/301250.301312

G. Crescenzo, T. Malkin, and R. Ostrovsky, Single Database Private Information Retrieval Implies Oblivious Transfer, In: Advances in Cryptology ? EUROCRYPT, pp.122-138, 2000.
DOI : 10.1007/3-540-45539-6_10

C. Cachin, S. Micali, and M. Stadler, Computationally private information retrieval with poly-logarithmic communication, In: EUROCRYPT, pp.402-414, 1999.

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

C. A. Melchor and Y. Deswarte, Single-Database Private Information Retrieval Schemes??: Overview, Performance Study, and Usage with Statistical Databases, In: Privacy in Statistical Databases, pp.257-265, 2006.
DOI : 10.1007/11930242_22

C. Aguilar-melchor and P. Gaborit, A lattice-based computationally-efficient private information retrieval protocol, In: WEWORC, 2007.

I. Damgard and M. Jurik, A length-flexible threshold cryptosystem with applications, Australasian Conference on Information Security and Privacy, 2007.

H. Bae, Design and analysis for log-squared and log private information retrieval, 2008.

C. Melchor, B. Crespin, P. Gaborit, and V. Jolivet, High-Speed Private Information Retrieval Computation on GPU, 2008 Second International Conference on Emerging Security Information, Systems and Technologies, 2008.
DOI : 10.1109/SECURWARE.2008.55
URL : https://hal.archives-ouvertes.fr/hal-00335223

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

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