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
Dissertation
Privacy-preserving computation and robust watermarking techniques for healthcare data
TL;DR: A watermarking scheme for genomic data is proposed to overcome the liability issues due to unauthorized sharing by service providers and robust-watermarking techniques ensure the detection of malicious parties with a high probability and the probabilistic limits of this detection with different experimental setups and evaluation metrics are shown.
Journal Article
Privacy-Preserving Regular Expression Matching using Nondeterministic Finite Automata
TL;DR: In this article , the authors propose a solution to solve the problem of the problem: this article ] of "uniformity" and "uncertainty" of the solution.
Journal ArticleDOI
Balancing Security and Privacy in Genomic Range Queries*
TL;DR: Wang et al. as discussed by the authors proposed a novel technique for a secure and private genomic range query protocol between a genomic testing facility and an individual user, which ensures authenticity and completeness of user-supplied genomic material while maintaining its privacy by releasing only the minimum thereof.
Patent
Authenticating acceptance of a string using an automaton
Takaaki Tateishi,Yuji Watanabe +1 more
TL;DR: In this article, a server connectable to a client for input of a string and that has an automaton defining a subsequent state for transition for each state and each character is presented.
Book ChapterDOI
Multiparty Evaluation of Finite State Machine.
TL;DR: This paper presents a mechanism of privately evaluating FSM in the presence of the semi-honest adversary, considered a set of mutually distrustful parties who want to evaluate a string on a FSM.
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.