Sciweavers

Share
CCS
2007
ACM

Privacy preserving error resilient dna searching through oblivious automata

10 years 9 months ago
Privacy preserving error resilient dna searching through oblivious automata
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and personalized nature of this information highlights the need for privacy-preserving protocols. In this paper, we present a new error-resilient privacy-preserving string searching protocol that is suitable for running private DNA queries. This protocol checks if a short template (e.g., a string that describes a mutation leading to a disease), known to one party, is present inside a DNA sequence owned by another party, accounting for possible errors and without disclosing to each party the other party’s input. Each query is formulated as a regular expression over a finite alphabet and implemented as an automaton. As the main technical contribution, we provide a protocol that allows to execute any finite state machine in an oblivious manner, requiring a communication complexity which is linear both in the nu...
Juan Ramón Troncoso-Pastoriza, Stefan Katze
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CCS
Authors Juan Ramón Troncoso-Pastoriza, Stefan Katzenbeisser, Mehmet Utku Celik
Comments (0)
books