The Mastermind attack on genomic data

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2009, Pages 204-218

  Goodrich, Michael T ^a  

^a Irvine   (United States)

Author keywords

Attacks; Genomic databases; Mastermind; Mitochondrial DNA; Privacy

Indexed keywords

CRYPTOGRAPHIC PROTOCOLS; DNA DATA; EFFICIENT IMPLEMENTATION; EXPERIMENTAL STUDIES; GENOMIC DATA; GENOMIC DATABASE; MITOCHONDRIAL DNA; PUBLIC KNOWLEDGE; REAL-WORLD;

CRYPTOGRAPHY; DATABASE SYSTEMS; DNA; MITOCHONDRIA; NETWORK SECURITY; NUCLEIC ACIDS;

GENES;

EID: 70449627419     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2009.4     Document Type: Conference Paper

References (40)

1. A. Amirbekyan and V. Estivill-Castro. A new efficient privacy-preserving scalar product protocol. In AusDM '07: Proceedings of the sixth Australasian conference on Data mining and analytics, pages 209-214, Darlinghurst, Australia, Australia, 2007. Australian Computer Society, Inc.
2. M. J. Atallah, F. Kerschbaum, and W. Du. Secure and private sequence comparisons. In WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society, pages 39-44, New York, NY, USA, 2003. ACM.
3. M. J. Atallah and J. Li. Secure outsourcing of sequence comparisons. Int. J. Inf. Secur., 4(4):277-287, 2005. (Pubitemid 41554602)
4. P. Baldi, R. W. Benz, D. Hirschberg, and S. Swamidass. Lossless compression of chemical fingerprints using integer entropy codes improves storage and retrieval. Journal of Chemical Information and Modeling, 47(6):2098-2109, 2007.
5. D. M. Behari, S. Rosset, J. Blue-Smith, O. Balanovsky, S. Tzuri, D. Comas, R. J. Mitchell, L. Quintana-Murci, C. Tyler-Smith, and R. S. Wells. The genographic project public participation mitochondrial DNA database. PLoS Genetics, 3(6), 2005. doi:10.1371/journal.pgen.0030104.
6. A. Ben-David, N. Nisan, and B. Pinkas. FairplayMP - a system for secure multi-party computation. In Proceedings of the ACM Computer and Communications Security Conference (ACM CCS), pages 257-266, New York, NY, USA, 2008. ACM.
7. M. Brandon, M. Lott, K. Nguyen, S. Spolim, S. Navathe, P. Baldi, and D. Wallace. MITOMAP: a human mitochondrial genome database - 2004 update. Nucleic Acids Research, 33:D611-D613, 2005. Database Issue.
8. M. C. Brandon, E. Ruiz-Pesini, D. Mishmar, V. Procaccio, M. T. Lott, K. C. Nguyen, S. Spolim, U. Patil, P. Baldi, and D. C. Wallace. MITOMASTER: A bioinformatics tool for the analysis of mitochondrial DNA sequences. Human Mutation, 0:1-6, 2008.
9. Z. Chen, C. Cunha, and S. Homer. Finding a hidden code by asking questions. In COCOON '96: Proceedings of the Second Annual International Conference on Computing and Combinatorics, volume 1090 of LNCS, pages 50-55. Springer, 1996.
10. G. M. Church. The personal genome project. Molecular Systems Biology, 1, 2005.
11. V. Chvátal. Mastermind. Combinatorica, 3(3/4):325-329, 1983.
12. I. H. G. S. Consortium. Initial sequencing and analysis of the human genome. Nature, 409:860-921, 2001.
13. I. Damga°rd, M. Fitzi, E. Kiltz, J. B. Nielsen, and T. Toft. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In S. Halevi and T. Rabin, editors, Theory of Cryptography, volume 3876 of Lecture Notes in Computer Science, pages 285-304. Springer, 2006.
14. M. Dickerson, D. Eppstein, M. T. Goodrich, and J. Meng. Confluent drawings: Visualizing non-planar diagrams in a planar way. In Proc. 11th Int. Symp. on Graph Drawing, volume 2912 of Lecture Notes in Computer Science, pages 1-12. Springer-Verlag, 2003.
15. W. Du and M. J. Atallah. Protocols for secure remote database access with approximate matching. In A. K. Ghosh, editor, E-Commerce Security and Privacy: Advances in Information Security, Volume 2, pages 87-112. Kluwer Academic Publishers, 2001.
16. W. Du and M. J. Atallah. Secure multi-party computation problems and their applications: a review and open problems. In NSPW '01: Proceedings of the 2001 workshop on New security paradigms, pages 13-22, New York, NY, USA, 2001. ACM.
17. M. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Advances in Cryptology - EUROCRYPT 2004., 2004.
18. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
19. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing, pages 218-229, New York, NY, USA, 1987. ACM.
20. M. T. Goodrich. On the algorithmic complexity of the mastermind game with black-peg results. Information Processing Letters, ?:to appear, 2009.
21. D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Commun. ACM, 18(6):341-343, 1975.
22. C. S. Iliopoulos and M. S. Rahman. Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci., 395(2-3):255-267, 2008.
23. S. Jha, L. Kruger, and V. Shmatikov. Towards practical privacy for genomic computation. In Proceedings of the 2008 IEEE Symposium on Security and Privacy, pages 216-230, Washington, DC, USA, 2008. IEEE Computer Society.
24. J. Kaiser. A plan to capture human ddveristy in 1000 genomes. Science, 319:395, 2008.
25. D. Knuth. The computer as a master mind. Journal of Recreational Mathematics, 9:1-5, 1977.
26. S. Levy, G. Sutton, P. C. Ng, and et al. The diploid genome sequence of an individual human. PLOS Biology, 5(10):2113-2144, 2007.
27. M. Newman. Power laws, Pareto distributions, and Zipf's law. Contemporary Physics, 46(5):323-351, 2005.
28. A. M. Odlyzko. The rise and fall of knapsack cryptosystems. In C. Pomerance, editor, Cryptology and Computational Number Theory, pages 75-88. Am. Math. Soc., 1990.
29. B. Pakendorf and M. Stoneking. Mitochondrial DNA and human evolution. Annual Rev. Genomics Hum. Genet., 6:165-183, 2005.
30. E. Ruiz-Pesini, M. T. Lott, V. Procaccio, J. Poole, M. C. Brandon, D. Mishmar, C. Yi, J. Kreuziger, P. Baldi, and D. C. Wallace. An enhanced MITOMAP with a global mtDNA mutational philogeny. Nucleic Acids Research, 35:D823-D828, 2007. Database Issue.
31. Y. Sang and H. Shen. Privacy preserving set intersection protocol secure against malicious behaviors. In PDCAT '07: Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies, pages 461-468, Washington, DC, USA, 2007. IEEE Computer Society.
32. Y. Sang and H. Shen. Privacy preserving set intersection based on bilinear groups. In ACSC '08: Proceedings of the thirty-first Australasian conference on Computer science, pages 47-54, Darlinghurst, Australia, Australia, 2008. Australian Computer Society, Inc.
33. R. F. Service. The race for the $1000 genome. Science, 311:1544-1546, 2006.
34. J. Stuckman and G.-Q. Zhang. Mastermind is np-complete, 2005. http://arxiv.org/abs/cs/0512049.
35. D. Szajda, M. Pohl, J. Owen, and B. G. Lawson. Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm. In Proceedings of the Network and Distributed System Security Symposium (NDSS), 2006.
36. J. R. Troncoso-Pastoriza, S. Katzenbeisser, and M. Celik. Privacy preserving error resilient dna searching through oblivious automata. In CCS '07: Proceedings of the 14th ACM conference on Computer and communications security, pages 519-528, New York, NY, USA, 2007. ACM.
37. J. D. Ullman, A. V. Aho, and D. S. Hirschberg. Bounds on the complexity of the longest common subsequence problem. J. ACM, 23(1):1-12, 1976.
38. J. Vaidya and C. Clifton. Secure set intersection cardinality with application to association rule mining. J. Comput. Secur., 13(4):593-622, 2005.
39. J. C. Venter, M. D. Adams, E. W. Myers, and P. W. Li et al. The sequence of the human genome. Science, 291:1304-1351, 2001.
40. A. C. Yao. Protocols for secure computations. In Proc. of 23rd Symp. on Foundations of Computer Science, pages 160-164, Washington, DC, USA, 1982. IEEE Computer Society.