ISSN 1000-1239 CN 11-1777/TP

Journal of Computer Research and Development ›› 2018, Vol. 55 ›› Issue (8): 1800-1808.doi: 10.7544/issn1000-1239.2018.20170320

Previous Articles     Next Articles

Publicly Verifiable Databases Scheme with Efficient Updates and Low Storage Overhead

Wu Qiyu, Zhou Fucai, Wang Qiang,Li Yuxi   

  1. (Software College, Northeastern University, Shenyang 110169)
  • Online:2018-08-01

Abstract: Aiming at the computational efficiency of outsourcing database and the completeness of query results, we propose a publicly verifiable database model with efficient updates and low storage overhead. Its description and security model are formalized, besides, a specific publicly verifiable database scheme with efficient updates and low storage overhead using the prime order bilinear groups is also proposed. Our scheme allows a resource-constrained client to securely outsource a very large database to a professional database service provider so that it could later retrieve or update a database record and verify the integrity of the retrieved data. The security of our scheme can be reduced to the hardness of the Square-CDH problem. Compared with the existing schemes, our scheme improves the computational efficiency by using the prime order bilinear groups. We construct the constant size parameter which is independent of the database that reduces the storage overhead of the client. In the meanwhile, the verification phase in the scheme does not require the data owner’s private key so it can be publicly verifiable. In addition, our scheme not only supports the modification of data, but also supports the insertion and deletion on data. The performance analysis shows that the cost of query, verification and update is independent of the database size.

Key words: verifiable database, public verifiability, outsourcing storage, constant size, bilinear map

CLC Number: