Privacy preserving error resilient DNA searching through oblivious automata

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2007, Pages 519-528

  Troncoso Pastoriza, Juan Ramón ^a   Katzenbeisser, Stefan ^b   Celik, Mehmet ^b  

^a UNIVERSITY OF VIGO   (Spain)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Approximate matching; Bioinformatics; DNA search; Fi nite automata; Homomorphic encryption; Levenshtein distance; Secure multiparty computa tion

Indexed keywords

APPROXIMATE MATCHING; COMMUNICATION COMPLEXITY; ERROR-RESILIENT; FINITE ALPHABET; FINITE STATE MACHINES; HOMOMORPHIC-ENCRYPTIONS; INPUT STRING; LEVENSHTEIN DISTANCE; NUMBER OF STATE; PRIVACY PRESERVING; PRIVACY-PRESERVING PROTOCOLS; REGULAR EXPRESSIONS; STRING-SEARCHING; TECHNICAL CONTRIBUTION; WEALTH OF INFORMATION;

BIOINFORMATICS; CRYPTOGRAPHY; DATA PRIVACY; DNA; DNA SEQUENCES; FINITE AUTOMATA; GENES; IMAGE QUALITY; NUCLEIC ACIDS; ROBOTS; TRANSLATION (LANGUAGES);

NETWORK SECURITY;

EID: 57049083569     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1315245.1315309     Document Type: Conference Paper

References (26)

1. Human gemome project. httpa://genomics.energy.gov.
2. M. J. Atallah, F. Kerschbaum, and W. Du. Secure and private sequence comparisons. In Proceedings of the 2003 ACM Workshop on privacy in the electronic society, pages 39-44, Washington, DC, 2003. ACM Press.
3. M. J. Atallah and J. Li. Secure outsourcing of sequence comparisons. International Journal of Information Security, 4 (4):23-36, October 2005.
4. R. E. Bellman. Dynamic Programming. Courier Dover Publications, 2003.
5. B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 25th Annual Symposium on Foundations of Computer Science FOCS'85, pages 383-395. IEEE Computer Society, 1985.
6. I. Damgå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 Proceedings of the third Theory of Cryptography Conference, TCC 2006, volume 3876 of Lecture Notes in Computer Science, pages 285-304. Springer-Verlag, 2006.
7. O. Goldreich. Secure multi-party computation. Working Draft, 2002.
8. O. Goldreich, S. Micali, and A. Widgerson. How to play any mental game. In Proceedings of the nineteenth annual ACM conference on Theory of Computing, pages 218-229, New York, U. S. A., 1987. ACM Press.
9. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28 (2):270-299, April 1984.
10. A. Hall. Coming soon: Your personal dna map? httpa://news. nationalgeographic.com/news/2006/03/0307-060307-dna.html.
11. J. E. Hopcroft and J. D. Ullman. Introduction to automata theory, languages, and computation. Addison Wesley, 1979.
12. M. Jacobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT'00, volume 1976 of Lecture Notes in Computer Science, pages 162-177. Springer-Verlag, 2000.
13. L. Kruger, S. Jha, E.-J. Goh, and D. Boneh. Secure function evaluation with ordered binary decision diagrams. In Proceedings of the 13th ACM conference on Computer and communications security CCS'06, pages 410-420, Virginia, U. S. A., November 2006. ACM Press.
14. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR, 163 (4):845-848, 1965.
15. English translation at Soviet Physics Doklady 10 (8):707-710, 1966.
16. M. Mohri. On some application of finite-state automata theory to natural language. Natural Language Engineering, 2 (1):1-20, 1996.
17. M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23 (2):269-311, 1997.
18. M. Naor and K. Nissim. Communication complexity and secure function evaluation. Electronic Colloquium on Computational Complexity (ECCC), 8 (062), 2001.
19. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In ACM Symposium on Theory of Computing, pages 590-599, 2001.
20. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 448-457, Washington, D. C., U. S. A., 2001.
21. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal on Molecular Biology, 48:443-453, 1970.
22. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - EUROCRYPT 1999, volume 1592 of Lecture Notes in Computer Science, pages 223-238. Springer, 1999.
23. K. U. Shulz and S. Mihov. Fast string correction with levenshtein automata. International Journal of Document Analysis and Recognition (IJDAR), 5 (1):67-85, 2002.
24. T. K. Vintsyuk. Speech discrimination by dynamic programming. Kibernetika, 4:52-57, 1968.
25. A. C. Yao. Protocols for secure computations. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 160-164, 1982.
26. S. Yu and Q. Zhuang. The state complexities of some basic operations on regular languages. Theoretical Computer Science, 125:315-328, 1994.