Proceedings ArticleDOI
Privacy preserving error resilient dna searching through oblivious automata
Juan Ramón Troncoso-Pastoriza,Stefan Katzenbeisser,Mehmet U. Celik +2 more
- pp 519-528
TLDR
A new error-resilient privacy-preserving string searching protocol that allows to execute any finite state machine in an oblivious manner, requiring a communication complexity which is linear both in the number of states and the length of the input string.Abstract:
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 number of states and the length of the input string.read more
Citations
More filters
Journal ArticleDOI
Oblivious DFA evaluation on joint input and its applications
TL;DR: This paper proposes oblivious DFA evaluation on joint input (denoted as F ODFA JI), a variant that extends the functionality of traditional oblivious D FA evaluation protocols and enables two participants to collaboratively evaluate a DFA on a joint input.
Journal ArticleDOI
PVOPM: Verifiable Privacy-Preserving Pattern Matching with Efficient Outsourcing in the Malicious Setting
TL;DR: The proposed PVOPM achieves both verifiability and text/pattern privacy against the collusion between the cloud and malicious receiver/sender, by generating authentication proofs of constant size and executing constant times of any one-way trapdoor permutation, independent to both the text size n and the pattern size m.
Book ChapterDOI
AU2EU: Privacy-Preserving Matching of DNA Sequences
Tanya Ignatenko,Milan Petkovic +1 more
TL;DR: In this paper, the authors present a solution to a particular problem of privacy-preserving matching of DNA sequences which can be used in clinical trials or other DNA services, and present an interesting research challenge to design secure operations on DNA sequences in the encrypted domain that allow a person to engage into a DNA-based service and obtain required (medical) answers without revealing his/her DNA.
Proceedings ArticleDOI
Streaming, Plaintext Private Information Retrieval Using Regular Expressions on Arbitrary Length Search Strings
TL;DR: This work developed a novel private pattern matching method that searches freeform, arbitrary length strings in streaming plaintext and retrieves corresponding elements and presents the design that encodes regular expressions into private queries, using an obfuscation method to limit frequency and graph quotient attacks by Bob.
Patent
System and method for deep packet inspection and intrusion detection
TL;DR: In this paper, a deep packet inspection and intrusion detection system using a pattern matching module receiving as an input a data stream in a neural network is presented. But the system is limited to a single input character.
References
More filters
Book
Dynamic Programming
TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
A general method applicable to the search for similarities in the amino acid sequence of two proteins
TL;DR: A computer adaptable method for finding similarities in the amino acid sequences of two proteins has been developed and it is possible to determine whether significant homology exists between the proteins to trace their possible evolutionary development.