TY - GEN
T1 - Flexible and publicly verifiable aggregation query for outsourced databases in cloud
AU - Yuan, Jiawei
AU - Yu, Shucheng
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84893546633&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893546633&partnerID=8YFLogxK
U2 - 10.1109/CNS.2013.6682770
DO - 10.1109/CNS.2013.6682770
M3 - Conference contribution
AN - SCOPUS:84893546633
SN - 9781479908950
T3 - 2013 IEEE Conference on Communications and Network Security, CNS 2013
SP - 520
EP - 524
BT - 2013 IEEE Conference on Communications and Network Security, CNS 2013
T2 - 1st IEEE International Conference on Communications and Network Security, CNS 2013
Y2 - 14 October 2013 through 16 October 2013
ER -