Paper 2019/1262

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

Shweta Agrawal, Rachit Garg, Nishant Kumar, and Manoj Prabhakaran


We introduce the notion of a Functionally Encrypted Datastore which collects data anonymously 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 notion is general enough to capture many real world scenarios that require controlled computation on encrypted data, such as is required for contact tracing in the wake of a pandemic. Our leakage and performance profile is similar to that of conventional searchable encryption systems, while the functionality we offer is significantly richer. In more detail, the client specifies a query as a pair (Q, f) where Q is a filtering predicate which 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 evaluate the efficiency of our protocols in computations relevant to the Genome Wide Association Studies such as Minor Allele Frequency (MAF), Chi-square analysis and Hamming Distance.

Note: Full version of the conference version.

Available format(s)
Cryptographic protocols
Publication info
Published elsewhere. ESORICS 2020
searchable symmetric encryptionsecure cloud storageencrypted searchfunctional encryption
Contact author(s)
nishant kr10 @ gmail com
rachit0596 @ gmail com
shweta a @ gmail com
manojmp @ gmail com
2020-10-31: revised
2019-11-05: received
See all versions
Short URL
Creative Commons Attribution


      author = {Shweta Agrawal and Rachit Garg and Nishant Kumar and Manoj Prabhakaran},
      title = {A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1262},
      year = {2019},
      doi = {10.1007/978-3-030-58951-6_3},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.