Download now Free registration required
This paper 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 which is treated as the input, 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 participating parties. Thus, in this paper the authors propose techniques for secure outsourcing of oblivious evaluation of finite automata to computational servers, such that the servers do not learn any information.
- Format: PDF
- Size: 165.5 KB