Cryptology ePrint Archive: Report 2019/1262

A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing

Shweta Agrawal and Rachit Garg and Nishant Kumar and Manoj Prabhakaran

Abstract: We introduce the notion of a Functionally Encrypted Datastore which collects data from multiple data-owners, stores it encrypted on an untrusted server, and allows untrusted clients to make select-and-compute queries on the collected data. Little coordination and no communication is required among the data-owners or the clients. Our security and performance profile is similar to that of conventional searchable encryption systems, while the functionality we offer is significantly richer. The client specifies a query as a pair (Q,f) where Q is a filtering predicate that selects some subset of the dataset and f is a function on some computable values associated with the selected data. We provide efficient protocols for various functionalities of practical relevance. We demonstrate the utility, efficiency, and scalability of our protocols via extensive experimentation. In particular, we use our protocols to model computations relevant to the Genome-Wide Association Studies such as Minor Allele Frequency (MAF), Chi-square analysis and Hamming Distance.

Category / Keywords: cryptographic protocols / searchable symmetric encryption, secure cloud storage, encrypted search, functional encryption

Date: received 30 Oct 2019

Contact author: nishant kr10 at gmail com,rachit0596@gmail com,shweta a@gmail com,manojmp@gmail com

Available format(s): PDF | BibTeX Citation

Version: 20191105:080411 (All versions of this report)

Short URL: ia.cr/2019/1262


[ Cryptology ePrint archive ]