.png){kind=icon}
返回
Optimal Weakly Secure Minimum Storage Regenerating Codes Scheme
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2947248.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In a distributed storage system, regenerating codes can be utilized to ensure data availability. This reduces the repair bandwidth but increases the risk of data eavesdropping on each node. Previous studies in this area generally only provided an approximate analysis of the security of schemes with information-theoretic security or weak security. Some researchers have further divided weak security into block security; however, they only analyzed several the regenerating codes schemes and proposed improved schemes with specific eavesdropping capabilities. In this study, we analyze the block security of a Cauchy-matrix-based product-matrix minimum storage regenerating(MSR) scheme and determine the optimal block security of MSR codes. Lastly, an improved MSR codes scheme for achieving optimal block security is proposed, and the relevant proof is provided.
Keyword:
Security
Maintenance engineering
Encoding
Eavesdropping
Bandwidth
Secure storage
Generators
Block security
distributed storage system
regenerating codes
weak security
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容