.png){kind=icon}
.png){kind=icon}
Return
Secure Verifiable Database Supporting Efficient Dynamic Operations in Cloud Computing
.png){kind=icon}
PRE
AI
DOI：10.1109/TETC.2017.2776402.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Storage is one of the main services that the cloud provides users. Utilizing the cloud to store large amounts of data can alleviate the cost of storage and the hardware investment on the local side, which is very important for resource-restricted clients. An emerging issue for clients is how to verify the database in the could after outsourcing their data to the cloud. Many verifiable database (VDB) schemes have been proposed by researchers that can solve this issue. However, some of the existing schemes cannot satisfy the practical requirements of database verifiability. In this paper, we propose a secure verifiable database scheme that is based on the polynomial commitment for cloud computing, which can realize the verifiability of database records in the cloud. Moreover, the proposed scheme can support public verifiability in that all clients in the system can verify the database. In addition, we use the BLS signature and the index-hash table to construct dynamic operations for the database. Security analysis shows that our scheme can achieve real-world security requirements. The simulation results show that our scheme is more efficient than similar schemes.
Keywords:
Cloud computing
Databases
Cryptography
Sun
Hardware
Investment
Verifiable database
polynomial commitment
cloud computing
public verifiability
Journal
IF:
5.4
Papers:
1.1K
Citations:
3.4K