Abstract
Метод защищенного распределения данных среди ненадежных и недоверенных узлов
Highlights
We consider a model of protecting the confidentiality and recoverability of data in a distributed storage system
We assume that adversary coalition contains no more than μ(∈ N) repositories and are able to obtain data from each of them
We offer a modification of the code noising method which provides high resistance to repetitive interception even in case when condition (1) is wrong
Summary
We consider a model of protecting the confidentiality and recoverability of data in a distributed storage system. A modification of the code noising method is constructed which simultaneously provides computational resistance to coalition attacks on confidentiality of stored data. The modification provides protection from the failure of a part of the storage nodes. Confidentiality protection is provided for coalitions of greater cardinality than in the case of using the classical method of code noising. It is shown that computational resistance is based on the complexity of solving one well-known problem of theoretical coding.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
