SECURING AGGREGATE QUERIES FOR DNA DATABASES

Author (s) : S.Kala, M.Ushanandhini

---

Abstract :

This paper proposes a new method for securing aggregate queries for DNA databases. The proposed method is based on the framework proposed by Kantarcioglu et al., but it extends the results in a number of ways. One improvement is that the proposed method is deterministic, with zero probability of a wrong answer. Another improvement is that the proposed method provides a new operating point in the space-time tradeoff. The proposed method also allows for a richer set of queries than exact matching between the query and each sequence of the database. These queries include: Counting the number of matches between the query symbols and a sequence. Logical OR matches where a query symbol is allowed to match a subset of the alphabet. Support for the extended alphabet of nucleotide base codes that encompasses ambiguities in DNA sequences. Queries that specify the number of occurrences of each kind of symbol in the specified sequence positions. A threshold query whose answer is "yes" if the number of matches exceeds a query-specified threshold. The proposed method is secure in the sense that the answers to the queries are hidden from the decrypting server. Only the client learns the answers to the queries. In all cases, the client deterministically learns only the query's answer, except for the threshold query, where we quantify the (very small) statistical leakage to the client of the actual count.

Keywords : DNA databases, aggregate queries, security, privacy, deterministic, statistical leakage

Conference Date : 13/11/2020

Pages : 184

Paper ID : 20184