Skip to main navigation Skip to search Skip to main content

Secure outsourcing of DNA searching via finite automata

  • University of Notre Dame

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

61 Scopus citations

Abstract

This work treats the problem of error-resilient DNA searching via oblivious evaluation of finite automata, where a client has a DNA sequence, and a service provider has a pattern that corresponds to a genetic test. Error-resilient searching is achieved by representing the pattern as a finite automaton and evaluating it on the DNA sequence, where privacy of both the pattern and the DNA sequence must be preserved. Interactive solutions to this problem already exist, but can be a burden on the participants. Thus, we propose techniques for secure outsourcing of finite automata evaluation to computational servers, which do not learn any information. Our techniques are applicable to any type of finite automata, but the optimizations are tailored to DNA searching.

Original languageEnglish
Title of host publicationData and Applications Security and Privacy XXIV - 24th Annual IFIP WG 11.3 Working Conference, Proceedings
Pages49-64
Number of pages16
DOIs
StatePublished - 2010
Event24th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy - Rome, Italy
Duration: Jun 21 2010Jun 21 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6166 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th Annual IFIP WG 11.3 Working Conference on Data and Applications Security and Privacy
Country/TerritoryItaly
CityRome
Period06/21/1006/21/10

Fingerprint

Dive into the research topics of 'Secure outsourcing of DNA searching via finite automata'. Together they form a unique fingerprint.

Cite this