.png){kind=icon}
返回
Efficient Verifiable Unbounded-Size Database From Authenticated Matrix Commitment
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2022.3225283.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Verifiable database with update (VDB) enables the client to store a large dataset in the outsourced database, and then efficiently query and update the data with a new value. It is attractive for the merits of checking the validity of the queried data and detecting the malicious actions of tampering with the outsourced database concurrently. However, the database in the context of VDB is merely suitable to store a fixed-size dataset. Hence, VDB is inapplicable to the unbounded-size database that provides the capability to store and manage the arbitrary-size datasets in the incremental manners. To circumvent the weaknesses, we research on the verifiable unbounded-size database with update (VUSDB). The VUSDB is sufficient for multiple clients to store their own arbitrary-size datasets in the database that has already contained some datasets. In order to design a VUSDB scheme, we first put forward a primitive called authenticated matrix commitment and give a scheme. This primitive is qualified to commit to a collection of ordered data represented in the form of matrix, and assure the ownership of the opened data. Then we utilize the authenticated matrix commitment scheme to construct a VUSDB scheme. The performance evaluation shows that the proposed schemes are efficient and practical.
Keyword:
Databases
Cloud computing
Servers
Indexes
Authentication
Security
Costs
Cloud computing
outsourced database
verifiable database
verifiable computation
期刊
IF:
7.5
论文数:
2.6K
被引数:
9.6K
机构
引用论文
.png){kind=icon}
Molecular Phylogeny of the Genus Frankia and Related Genera and Emendation of the Family FrankiaceaeFrankia属和相关属的分子系统发育以及Frankiaceae家族的鉴定
OAAI
OAAI分享收藏分享收藏
查看更多内容