Toward A Practical Data Privacy Scheme for A Distributed Implementation of the Smith-Waterman Genome Sequence Comparison Algorithm

Proceedings of the Symposium on Network and Distributed System Security, NDSS 2006

Volumn , Issue , 2006, Pages

  Szajda, Doug ^a   Pohl, Michael ^a   Owen, Jason ^a   Lawson, Barry ^a  

^a UNIVERSITY OF RICHMOND   (United States)

Author keywords

data privacy; distributed computation; Smith Waterman algorithm

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GENES; PERSONAL COMPUTERS; SUPERCOMPUTERS;

COMPUTATIONAL POWER; DISTRIBUTED COMPUTATIONS; DISTRIBUTED IMPLEMENTATION; GENOME SEQUENCES; NUCLEOTIDES SEQUENCES; PRIVACY SOLUTIONS; RUNNING-IN; SEQUENCE COMPARISONS; SMITH-WATERMAN; SMITH-WATERMAN ALGORITHMS;

DATA PRIVACY;

EID: 85129493630     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. M. Abadi and J. Feigenbaum. Secure circuit evaluation: A protocol based on hiding information from an oracle. Journal of Cryptology, 2(1):1–12, 1990.
2. M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. In Proceedings of the 19th ACM Symposium on the Theory of Computing, pages 195–203, 1987.
3. M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. Journal of Computer and System Sciences, 39(1):21–50, August 1989.
4. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi. Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. Cryptology ePrint Archive, Report 2005/254, 2005. http://eprint.iacr.org/.
5. N. Ahituv, Y. Lapid, and S. Neumann. Processing encrypted data. Commun. ACM, 30(9):777–780, 1987.
6. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pages 284–293, El Paso, Texas, May 1997.
7. S. Altschul and W. Gish. Local alignment statistics. Methods Enzymol, 266:460–480, 1996.
8. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proceedings of 8th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 201–209, 1989.
9. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols. In Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, pages 503–513. ACM Press, 1990.
10. M. Ben-Or and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 1–10, 1988.
11. M. Bishop. Computer Security: Art and Science. Addison-Wesley, 2003.
12. E. Brickell and Y. Yacobi. On privacy homomorphisms (extended abstract). In D. Chaum and W. Price, editors, Advances in Cryptology—EUROCRYPT ‘87, volume 304 of Lecture Notes in Computer Science, pages 117–126, Berlin, 1987. Springer-Verlag.
13. E. Chargaff. Structure and function of nucleic acids as cell constituents. Fed. Proc, 10:654–659, 1951.
14. D. Chaum, C. Crépeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 11–19, 1988.
15. J. Domingo-Ferrer. A new privacy homomorphism and applications. Information Processing Letters, 60(5):277–282, December 1996.
16. C. Dwork, M. Naor, and O. Reingold. Immunizing encryption schemes from decryption errors. In C. Cachin and J. Camenisch, editors, Advances in Cryptology – EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 342–360, Interlaken, Switzerland, May 2004. Springer-Verlag.
17. J. Feigenbaum. Encrypted problem instances, or... Can you take advantage of someone without having to trust him? In Proceedings of Crypto’ 85, pages 477–488. Springer-Verlag, 1986.
18. Genbank. http://www.ncbi.nlm.nih.gov/GenBank/GenBankOverview.html.
19. O. Goldreich. Secure multi-party computation. Working Draft, 2000.
20. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, pages 218–229, 1987.
21. P. Golle and I. Mironov. Uncheatable distributed computations. In Proceedings of the RSA Conference 2001, Cryptographers’ Track, pages 425–441, San Francisco, CA, 2001. Springer.
22. P. Golle and S. Stubblebine. Secure distributed computing in a commercial environment. In P. Syverson, editor, Proc. of Financial Crypto 2001, volume 2339 of Lecture Notes in Computer Science, pages 289–304. Springer-Verlag, 2001.
23. S. Karlin and S. Altschul. Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proceedings of the National Academy of Sciences (USA), 87:2264–2268, March 1990.
24. S. Karlin and S. Altschul. Applications and statistics for multiple high-scoring segments in molecular sequences. Proceedings of the National Academy of Sciences (USA), 90:5873–5877, June 1993.
25. F. Monrose, P. Wyckoff, and A. Rubin. Distributed execution with remote audit. In Proceedings of the 1999 ISOC Network and Distributed System Security Symposium, pages 103–113, 1999.
26. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443–453, 1970.
27. W. Pearson. Empirical statistical estimates for sequence similariy searches. Journal of Molecular Biology, 276:71–84, 1998.
28. T. Phan, L. Huang, and C. Dulan. Challenge: Integrating mobile wireless devices into the computational grid. In Proceedings of the Eight International Conference on Mobile Computing and Networking (MobiCom 2002), pages 271–278, Atlanta, GA, September 2002.
29. R. Rivest, L. Adleman, and M. Dertouzos. On data banks and privacy homomorphisms. In R. D. Millo, D. Dobkin, A. Jones, and R. Lipton, editors, Foundations of Secure Computation, pages 169–179. Academic Press, New York, 1978.
30. R. D. Sa, L. Runyen-Janecky, and J. Gindhart, July 2005. Personal conversations.
31. 1. In IEEE Symposium on Foundations of Computer Science, pages 554–567, 1999.
32. L. Sarmenta. Sabotage-tolerance mechanisms for volunteer computing systems. Future Generation Computer Systems, 18(4):561–572, March 2002.
33. T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195–197, 1981.
34. D. Szajda, B. Lawson, and J. Owen. Hardening functions for large-scale distributed computations. In Proceedings of the 2003 IEEE Symposium on Security and Privacy, pages 216–224, Berkeley, CA, May 2003.
35. D. Szajda, B. Lawson, and J. Owen. Toward an optimal redundancy strategy for distributed computations. In Proceedings of the 2005 IEEE International Conference on Cluster Computing (Cluster 2005), Boston, MA, September 2005.
36. S. Tate and K. Xu. On garbled circuits and constant round secure function evaluation. Technical Report TR 2003-02, University of North Texas, Computer Privacy and Security (CoPS) Lab, 2003.
37. M. Waterman. Introduction to Computational Biology: Maps, Sequences, and Genomes. Interdisciplinary Statistics. Chapman & Hall, 1995.
38. A. Yao. How to generate and exchange secrets. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 162–167, Toronto, Canada, October 1986.