Secure Codes With Accessibility for Distributed Storage
Secure Codes With Accessibility for Distributed Storage
复制标题
具有分布式存储可访问性的安全代码
DOI：
10.1109/tifs.2021.3128822
复制
发表时间：
2021
影响因子：
6.8
通讯作者：
Antonia Wachter-Zeh
中科院分区：
文献类型：
--
作者：
Lukas Holzbaur;Stanislav Kruglik;Alexey Frolov;Antonia Wachter-Zeh
分布式存储系统必须支持对存储数据的高效访问，同时保证暂时不可用的节点能够正常恢复。分布式存储系统的另一个重要方面是安全性。在本文中，我们将这些特征结合在一起，并研究了在访问有限数量节点的被动窃听者存在的情况下对存储数据的有效访问问题。访问效率可以用两个不同的术语来衡量，即访问节点的数量和产生的网络流量。这些量与分布式存储系统的局部性和修复带宽有着天然的联系。对于每一种情况，我们都推导了参数的界，并给出了基于最大距离可分离码的显式结构。从实际角度出发，我们提出了确保每个节点相同工作量的技术，以及基于子域子码、欧几里德几何码和里德-穆勒码的小域构造。最后，给出了安全分布式存储系统参数的渐近随机编码界，并提出了进一步的研究方向。
A distributed storage system must support efficient access to stored data while ensuring recovery of temporally unavailable nodes. Another important aspect of a distributed storage system is security. In this paper, we bring these features together and investigate the problem of efficient access to stored data in presence of a passive eavesdropper with access to limited number of nodes. The access efficiency is measured in two different terms, namely, the number of accessed nodes and the volume of generated network traffic. These quantities possess a natural connection to locality and repair bandwidth in distributed storage system. For each of them we derive bounds on parameters and provide explicit constructions based on maximum distance separable codes. Motivated by practical perspectives we propose the techniques to ensure the same workload on each node as well as constructions over small fields based on subfield subcodes, Euclidean geometry codes and Reed-Muller codes. Finally, we derive an asymptotic random coding bound on parameters of a secure distributed storage system and propose further research directions.