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
Book ChapterDOI
Private-Key Fully Homomorphic Encryption for Private Classification
TL;DR: An overview of an implementation of a private-key fully homomorphic encryption scheme in a protocol for private Naive Bayes classification, which allows a data owner to privately classify her data point without direct access to the learned model.
Journal Article
Towards an Information Theoretic Analysis of Searchable Encryption (Extended Version)
Abstract: Searchable encryption is a technique that allows a client to store
data in encrypted form on a curious server, such that data can be
retrieved while leaking a minimal amount of information to the
server. Many searchable encryption schemes have been proposed and
proved secure in their own computational model. In this paper we
propose a generic model for the analysis of searchable
encryptions. We then identify the security parameters of
searchable encryption schemes and prove information theoretical
bounds on the security of the parameters. We argue that perfectly
secure searchable encryption schemes cannot be efficient. We
classify the seminal schemes in two categories: the schemes that
leak information upfront during the storage phase, and schemes
that leak some information at every search. This helps designers
to choose the right scheme for an application.
Proceedings ArticleDOI
Privacy and Security in the Genomic Era
Erman Ayday,Jean-Pierre Hubaux +1 more
TL;DR: This short tutorial will help computer scientists better understand the privacy and security challenges in today's genomic era and present the high level descriptions of the proposed solutions to protect the privacy of genomic data.
Proceedings ArticleDOI
Towards Privacy-Preserving XML Transformation
Meiko Jensen,Florian Kerschbaum +1 more
TL;DR: The steps required for applying XML transformations to encrypted data are illustrated, the cryptographic building blocks are presented, and an outlook on advantages and weaknesses of the proposed encryption scheme are given.
Journal ArticleDOI
Automata Evaluation and Text Search Protocols with Simulation-Based Security
TL;DR: This paper presents efficient protocols for securely computing the following two problems: the fundamental problem of pattern matching and a novel protocol for secure oblivious automata evaluation which is of independent interest.
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.