DocumentCode :
653840
Title :
Flexible and publicly verifiable aggregation query for outsourced databases in cloud
Author :
Jiawei Yuan ; Shucheng Yu
Author_Institution :
Dept. of Comput. Sci., Univ. of Arkansas at Little Rock, Little Rock, AR, USA
fYear :
2013
fDate :
14-16 Oct. 2013
Firstpage :
520
Lastpage :
524
Abstract :
For securing databases outsourced to the cloud, it is important to allow cloud users to verify that their queries to the cloud-hosted databases are correctly executed by the cloud. Existing solutions on this issue suffer from a high communication cost, a heavy storage overhead or an overwhelming computational cost on clients. Besides, only simple SQL queries (e.g., selection query, projection query, weighted sum query, etc) are supported in existing solutions. For practical considerations, it is desirable to design a client-verifiable (or publicly verifiable) aggregation query scheme that supports more flexible queries with affordable storage overhead, communication and computational cost for users. This paper investigates this challenging problem and proposes an efficient publicly verifiable aggregation query scheme for databases outsourced to the cloud. By designing a renewable polynomial-based authentication tag, our scheme supports a wide range of practical SQL queries including polynomial queries of any degrees, variance query and many other linear queries. Remarkably, our proposed scheme only introduces constant communication and computational cost to cloud users. Our scheme is provably secure under the Static Diffie-Hellman problem, the t-Strong Diffie-Hellman problem and the Computational Diffie-Hellman problem. We show the efficiency and scalability of our scheme through extensive numerical analysis.
Keywords :
SQL; client-server systems; cloud computing; numerical analysis; outsourcing; query processing; relational databases; security of data; SQL queries; client-verifiable aggregation query scheme; cloud-hosted databases; computational Diffie-Hellman problem; constant communication cost; constant computational cost; flexible-publicly verifiable aggregation query; linear queries; numerical analysis; outsourced database security; polynomial query degrees; projection query; renewable polynomial-based authentication tag design; selection query; static Diffie-Hellman problem; storage overhead; t-strong Diffie-Hellman problem; variance query; weighted sum query; Authentication; Cloud computing; Cryptography; Databases; Polynomials; Servers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Network Security (CNS), 2013 IEEE Conference on
Conference_Location :
National Harbor, MD
Type :
conf
DOI :
10.1109/CNS.2013.6682770
Filename :
6682770
Link To Document :
بازگشت