.png){kind=icon}
返回
New Publicly Verifiable Databases with Efficient Updates
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2014.2366471.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The notion of verifiable database (VDB) enables a resource-constrained client to securely outsource a very large database to an untrusted server so that it could later retrieve a database record and update it by assigning a new value. Also, any attempt by the server to tamper with the data will be detected by the client. Very recently, Catalano and Fiore [17] proposed an elegant framework to build efficient VDB that supports public verifiability from a new primitive named vector commitment. In this paper, we point out Catalano-Fiore's VDB framework from vector commitment is vulnerable to the so-called forward automatic update (FAU) attack. Besides, we propose a new VDB framework from vector commitment based on the idea of commitment binding. The construction is not only public verifiable but also secure under the FAU attack. Furthermore, we prove that our construction can achieve the desired security properties.
Keyword:
Verifiable database
cloud computing
secure outsourcing
vector commitment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.5K
被引数:
9.6K
机构
引用论文
分享收藏Genomic Organization, Phylogenetic Comparison and Differential Expression of the SBP-Box Family Genes in Grape.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAI分享收藏
分享收藏
查看更多内容