Secret sequence comparison on public grid computing resources

Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially novel gene needs to keep the sequence itself in confidence. However, to compare the potentially novel sequence with known sequences, it must either be sent as a query to public databases, or these databases must be downloaded onto a local computer. In both cases, the potentially new sequence is exposed to the public. In this work, we propose a novel method to compare sequences without any exact sequence information leaks to the public. This method is based on our previous proposed method [1] to find unique sequences on grid computing environments, which is well-parallelized in reasonable performance. In order to keep the exact sequence information in confidence, this method samples intervals (subsequences) from a sequence, and these intervals are hashed. Any key cryptosystem is not used. The hashed data are...

• Type: Conference
• Year: 2005
• Where: CCGRID
• Authors: Ken-ichi Kurata, Hiroshi Nakamura, Vincent Breton
• Keywords: CCGRID 2005, Cluster Computing, Exact Sequence Information, Method Samples Intervals, Sequenced