Information-Theoretically Secure Erasure Codes for Distributed Storage
From MaRDI portal
Publication:4566732
DOI10.1109/TIT.2017.2769101zbMATH Open1390.94867arXiv1508.03787OpenAlexW2963136329MaRDI QIDQ4566732FDOQ4566732
Authors: Korlakai Vinayak Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar 
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Repair operations in distributed storage systems potentially expose the data to malicious acts of passive eavesdroppers or active adversaries, which can be detrimental to the security of the system. This paper presents erasure codes and repair algorithms that ensure security of the data in the presence of passive eavesdroppers and active adversaries, while maintaining high availability, reliability and efficiency in the system. Our codes are optimal in that they meet previously proposed lower bounds on the storage, network-bandwidth, and reliability requirements for a wide range of system parameters. Our results thus establish the capacity of such systems. Our codes for security from active adversaries provide an additional appealing feature of `on-demand security' where the desired level of security can be chosen separately for each instance of repair, and our algorithms remain optimal simultaneously for all possible levels. The paper also provides necessary and sufficient conditions governing the transformation of any (non-secure) code into one providing on-demand security.
Full work available at URL: https://arxiv.org/abs/1508.03787
Cited In (4)
This page was built for publication: Information-Theoretically Secure Erasure Codes for Distributed Storage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566732)
