Secure outsourcing of DNA searching via finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6166 LNCS, Issue , 2010, Pages 49-64

  Blanton, Marina ^a   Aliasgari, Mehrdad ^a  

^a University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR-RESILIENT; GENETIC TESTS; SERVICE PROVIDER;

DATA PRIVACY; FINITE AUTOMATA; OUTSOURCING; TRANSLATION (LANGUAGES); DNA SEQUENCES; MOBILE SECURITY; SECURITY OF DATA;

DNA;

EID: 77958487669     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13739-6_4     Document Type: Conference Paper

References (28)

1. Atallah, M., Kerschbaum, F., Du, W.: Secure and private sequence comparisons. In: WPES, pp. 39-44 (2003)
2. Jha, S., Kruger, L., Shmatikov, V.: Towards practical privacy for genomic computation. In: IEEE Symposium on Security and Privacy, pp. 216-230 (2008)
3. Troncoso-Pastoriza, J., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient DNA searching through oblivious automata. In: ACM CCS, pp. 519-528 (2007)
4. Frikken, K.: Practical private DNA string searching and matching through efficient oblivious automata evaluation. In: DBSec, pp. 81-94 (2009)
5. Bruekers, F., Katzenbeisser, S., Kursawe, K., Tuyls, P.: Privacy-preserving matching of DNA profiles. ePrint Cryptology Archive Report 2008/203 (2008)
6. Wang, R., Wang, X., Li, Z., Tang, H., Reiter, M., Dong, Z.: Privacy-preserving genomic computation through program specialization. In: ACM CCS, pp. 338-347 (2009)
7. Atallah, M., Li, J.: Secure outsourcing of sequence comparisons. In: PET, pp. 63-78 (2004) (Pubitemid 41251997)
8. Atallah, M., Li, J.: Secure outsourcing of sequence comparisons. International Journal of Information Security 4(4), 277-287 (2005) (Pubitemid 41554602)
9. Genetic Testing for Health, Disease & Ancestry; DNA Test - 23 and Me, http://www.23andme.com
10. Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. Technical Report 2010-03, University of Notre Dame (2010)
11. Szajda, D., Pohl, M., Owen, J., Lawson, B.: Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm. In: NDSS (2006)
12. Kantarcioglu, M., Jiang, W., Liu, Y., Malin, B.: A cryptographic approach to securely share and query genomic sequences. IEEE Transactions on Information Technology in Biomedicine 12(5), 606-617 (2008)
13. Franklin, M., Gondree, M., Mohassel, P.: Communication-efficient private protocols for longest common subsequence. In: RSA, pp. 265-278 (2009)
14. Gondree, M., Mohassel, P.: Longest common subsequence as private search. In: WPES, pp. 81-90 (2009)
15. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448-457 (2001)
16. Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., López, J., Deng, R. H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314-328. Springer, Heidelberg (2005)
17. Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: ICALP, pp. 803-815 (2005)
18. Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: STOC (1999)
19. Crescenzo, G., Malkin, T., Ostrovsky, R.: Single database private information retrieval implies oblivious transfer. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 122-138. Springer, Heidelberg (2000)
20. Cachin, C., Micali, S., Stadler, M.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402-414. Springer, Heidelberg (1999)
21. Kushilevitz, E., Ostrovsky, R.: Replication is not needed: Single database, computationally-private information retrieval. In: IEEE FOCS, pp. 364-373 (1997)
22. Melchor, C. A., Deswarte, Y.: Single-database private information retrieval schemes: Overview, performance study, and usage with statistical databases. In: Privacy in Statistical Databases, pp. 257-265 (2006)
23. Aguilar-Melchor, C., Gaborit, P.: A lattice-based computationally- efficient private information retrieval protocol. In: WEWORC (2007)
24. Damgard, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Australasian Conference on Information Security and Privacy (2007)
25. Bae, H.: Design and analysis for log-squared and log private information retrieval (2008)
26. Melchor, C., Crespin, B., Gaborit, P., Jolivet, V.: High-speed private information retrieval computation on GPU. In: IEEE SECURWARE (2008)
27. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: STOC, pp. 218-229 (1987)
28. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)