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, 2003.
DOI : 10.1145/1005140.1005147
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6669

M. Atallah and J. Li, Secure outsourcing of sequence comparisons, Workshop on Privacy Enhancing Technologies (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, DBSec, pp.49-64, 2010.
DOI : 10.1007/978-3-642-13739-6_4
URL : https://hal.archives-ouvertes.fr/hal-01056669

Y. Huang, D. Evans, J. Katz, and L. Malka, Faster secure two-party computation using garbled circuits, USENIX Security Symposium, 2011.

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

V. Kolesnikov, A. Sadeghi, and T. Schneider, Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima, CANS, pp.1-20, 2009.
DOI : 10.1007/978-3-642-10433-6_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2387

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, Network and Distributed System Security Symposium (NDSS), 2006.

A. Yao, How to generate and exchange secrets, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.162-167, 1986.
DOI : 10.1109/SFCS.1986.25

C. Gentry, Fully homomorphic encryption using ideal lattices, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, 2009.
DOI : 10.1145/1536414.1536440
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.362.7592

M. Blanton, M. Atallah, K. Frikken, and Q. Malluhi, Secure and Efficient Outsourcing of Sequence Comparisons, ESORICS, pp.505-522, 2012.
DOI : 10.1007/978-3-642-33167-1_29

Y. Lindell 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.1007/s00145-008-9036-8

R. Gennaro, C. Gentry, and B. Parno, Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers, pp.465-482, 2010.
DOI : 10.1007/978-3-642-14623-7_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.1571

B. Parno, M. Raykova, and V. Vaikuntanathan, How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption, TCC, pp.422-439, 2012.
DOI : 10.1007/978-3-642-28914-9_24

M. Blanton, Y. Zhang, and K. Frikken, Secure and Verifiable Outsourcing of Large- Scale Biometric Computations, IEEE International Conference on Information Privacy, Security, Risk and Trust (PASSAT), pp.1185-1191, 2011.

S. S. Vivek, S. S. Selvi, R. Venkatesan, and C. P. Rangan, A Special Purpose Signature Scheme for Secure Computation of Traffic in a Distributed Network, Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, pp.46-60, 2012.

J. Wang, H. Ma, Q. Tang, J. Li, H. Zhu et al., A New Effcient Veriable Fuzzy Keyword Search Scheme, Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, pp.61-71, 2012.