Optimal Weakly Secure Minimum Storage Regenerating Codes Scheme
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...
Main Authors: | Jianchao Bian, Shoushan Luo, Zhengwen Li, Yixian Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8868159/ |
Similar Items
-
Multilevel Diversity Coding with Secure Regeneration: Separate Coding Achieves the MBR Point
by: Shuo Shao, et al.
Published: (2018-09-01) -
Minimum Storage Regenerating Codes for Scalable Distributed Storage
by: Huayu Zhang, et al.
Published: (2017-01-01) -
THE EXPERIENCE OF COMPARISON OF STATIC SECURITY CODE ANALYZERS
by: Alexey Markov, et al.
Published: (2015-09-01) -
Weakly Secure Coded Caching Scheme for an Eavesdropper Having Prior Knowledge
by: Nan Wang, et al.
Published: (2020-01-01) -
Some applications of finite geometry for secure network coding
by: Fancsali Sz. L., et al.
Published: (2008-10-01)