Practical private DNA string searching and matching through efficient oblivious automata evaluation

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

Volumn 5645 LNCS, Issue , 2009, Pages 81-94

  Frikken, Keith B ^a  

^a MIAMI UNIVERSITY   (United States)

Author keywords

Cryptography; DNA matching; Privacy Preserving Protocols

Indexed keywords

DNA STRINGS; FINITE STATE MACHINES; MODULAR EXPONENTIATIONS; NEW PROTOCOL; NUMBER OF STATE; PRIVACY-PRESERVING PROTOCOLS; THREE ORDERS OF MAGNITUDE;

CRYPTOGRAPHY; DNA; GENES; NUCLEIC ACIDS; ROBOTS; TRANSLATION (LANGUAGES); AUTOMATA THEORY; DATA PRIVACY; LOGIC CIRCUITS;

FINITE AUTOMATA; SECURITY OF DATA;

EID: 70350370031     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03007-9_6     Document Type: Conference Paper

References (20)

1. The 100 dollars Genome, Technology Review, published by MIT, April 17 (2008), http://www.technologyreview.com/Biotech20640/page1/
2. Genetic Information Nondiscrimination Act, http://en.wikipedia.org/wiki/ Genetic-Information-Nondiscrimination-Act
3. Atallah, M., Kerschbaum, F., Du, W.: Secure and private sequence comparisons. In: WPES 2003: Proceedings of the 2003 ACM workshop on Privacy in the electronic society, pp. 39-44. ACM, New York (2003)
4. Beaver, D.: Minimal-latency secure function evaluation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 335-350. Springer, Heidelberg (2000)
5. Cachin, C., Camenisch, J., Kilian, J., Müller, J.: One-round secure computation and secure autonomous mobile agents. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 512. Springer, Heidelberg (2000)
6. 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)
7. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)
8. Canetti, R., Ishai, Y., Kumar, R., Reiter, M., Rubinfeld, R., Wright, R.: Selective private function evaluation with applications to private statistics. In: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, pp. 293-304. ACM Press, New York (2001)
9. Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965-981 (1998)
10. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, pp. 218-229. ACM Press, New York (1987)
11. Jha, S., Kruger, L., Shmatikov, V.: Towards practical privacy for genomic computation. In: IEEE Symposium on Security and Privacy, SP 2008, May 2008, pp. 216-230 (2008)
12. Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: FOCS 1997: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 364-373. IEEE Computer Society, Los Alamitos (1997)
13. Lindell, Y., Pinkas, B.: A proof of yao's protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004/175 (2004), http://eprint.iacr.org/
14. Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - a secure two-party computation system. In: Proceedings of Usenix Security (2004)
15. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA 2001: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 448-457. Society for Industrial and Applied Mathematics (2001)
16. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
17. Sander, T., Young, A., Yung, M.: Non-interactive cryptocomputing for NC1. In: 40th Annual Symposium on Foundations of Computer Science, pp. 554-566 (1999)
18. Troncoso-Pastoriza, J., Katzenbeisser, S., Celik, M.: Privacy preserving error resilient dna searching through oblivious automata. In: CCS 2007: Proceedings of the 14th ACM conference on Computer and communications security, pp. 519-528. ACM, New York (2007)
19. Yao, A.: Protocols for secure computations. In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pp. 160-164. IEEE Computer Society Press, Los Alamitos (1982)
20. Yao, A.: How to generate and exchange secrets. In: Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 162-167. IEEE Computer Society Press, Los Alamitos (1986)