Security in Distributed Storage Systems
Lists
Only you see this
Abstract
The proliferation of cloud applications in recent years has made securing the underlying distributed storage systems (DSSs) an important problem. This chapter focuses on the fundamental limits of information theoretic security in DSSs, with an emphasis on constructing efficient codes for achieving these limits. The challenge of studying security in DSSs results from their dynamic behavior characterized by nodes frequently leaving and joining the DSS. This dynamic behavior distinguishes them from static models typically studied in the area of information theoretic security. This chapter introduces the theoretical model of DSSs and summarizes the main results in the area. Three types of adversaries are studied: passive, active omniscient, and active limited-knowledge adversaries. For each type of attack, upper bounds on the secrecy or resiliency capacity are given, as well as capacity-achieving secure codes for certain regimes. Moreover, open problems are highlighted and discussed.
BibTeX
@inproceedings{rouayheb2017security,
author = {Salim El Rouayheb and Sreechakra Goparaju and Kannan Ramchandran},
title = {{Security in Distributed Storage Systems}},
booktitle = {Cambridge},
year = {2017},
doi = {10.1017/9781316450840.020},
}Loading related content...