A multistage protocol for aggregated queries in distributed cloud databases with privacy protection

Kelarev, A, Yi, X, Badsha, S, Yang, X, Rylands, L and Seberry, J 2019, 'A multistage protocol for aggregated queries in distributed cloud databases with privacy protection', Future Generation Computer Systems, vol. 90, pp. 368-380.


Document type: Journal Article
Collection: Journal Articles

Title A multistage protocol for aggregated queries in distributed cloud databases with privacy protection
Author(s) Kelarev, A
Yi, X
Badsha, S
Yang, X
Rylands, L
Seberry, J
Year 2019
Journal name Future Generation Computer Systems
Volume number 90
Start page 368
End page 380
Total pages 13
Publisher Elsevier
Abstract This article is devoted to the novel situation, where a large distributed cloud database is a union of several separate databases belonging to individual database owners who are not allowed to transfer their data for storage in locations different from their already chosen separate cloud service providers. For example, a very large number of medical records may be stored in a distributed cloud database, which is a union of several separate databases from different hospitals, or even from different countries. The owners of the databases may need to provide answers to certain common aggregated queries using all information available without sharing or transferring all data. It is necessary to minimize the communication costs, improve efficiency, and comply with the legal requirements protecting the privacy of confidential data. In this situation, it is impossible to aggregate the whole database in one location, but effective methods for answers to the aggregated queries with privacy protection are required. To solve this important problem, the present article proposes a Multistage Separate Query Processing (MSQP) protocol employing homomorphic encryption with split keys. We show that our protocol can answer a large class of natural queries of practical significance. The running time of the MSQP protocol is O(d+[Formula presented]), where d is the number of database owners and m is the total number of records in the whole database. In practice, d is small, m can be very large, and so the running time is O(m). This means that the protocol is very efficient for large databases. It dramatically reduces the communication costs of computation and completely eliminates the need for exchange of confidential data. We define a new generalized additive homomorphic property and introduce a Multipart ElGamal Cryptosystem (MEC) with split keys, which enjoys this property. MEC is a novel modification of the ElGamal cryptosystem with split keys. This paper presents the results
Subject Computer System Security
Data Encryption
Distributed and Grid Systems
Keyword(s) Cloud services
Distributed databases
Generalized homomorphic property
Multipart elGamal cryptosystem
Privacy protection
Split keys
DOI - identifier 10.1016/j.future.2018.08.017
Copyright notice © 2018 Published by Elsevier B.V.
ISSN 0167-739X
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 0 times in Scopus Article
Altmetric details:
Access Statistics: 24 Abstract Views  -  Detailed Statistics
Created: Fri, 14 Dec 2018, 16:06:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us