.png){kind=icon}
返回
Efficient verifiable databases with additional insertion and deletion operations in cloud computing
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2020.09.028.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Verifiable database (VDB) schemes allow the data owner to outsource a large database to the cloud so that any resource-constraint client could later retrieve the database records and check whether the cloud returns valid records or not. Meanwhile, the database can be updated by the data owner. To the best of our knowledge, there is no secure and efficient VDB scheme supporting public verification and all kinds of update operations (i.e., insertion, modification, and deletion) simultaneously. To resolve this problem, we propose an efficient VDB scheme by incorporating vector commitment (VC) with Merkle Interval Hash Tree (MIHT). To enhance the security (i.e., resist the forward automatic update attack), we re-formalize the syntax of VC and present a new construction of VC based on modified Generalized Bilinear Inversion (mGBI) assumption. Our proposed VC scheme is used for guaranteeing the integrity of data. Like the traditional VC schemes, our proposed scheme remains publicly verifiable. MIHT is a new primitive introduced by us, which is mainly used to support all update operations. Security analysis shows that our proposed VDB scheme can achieve real-world security requirements. The detailed performance analyses and simulations show that our proposed schemes are more practical in the real world. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Vector commitment
Merkle Interval Hash Tree
Publicly verifiable
Verifiable databases
All update operations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
分享收藏
A survey on Proof of Retrievability for cloud data integrity and availability: Cloud storage state-of-the-art, issues, solutions and future trends云数据完整性和可用性的可检索性证明调查: 云存储的最新技术，问题，解决方案和未来趋势
PREAI
分享收藏
查看更多内容