Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 2019, Volume 19, Issue 3, Pages 326–337
A method of protected distribution of data among unreliable and untrusted nodes
Yu. V. Kosolapov, F. S. Pevnev
Institute of Mathematics, Mechanics, and Computer Science named after of I. I. Vorovich, Southern Federal University, 8a Milchakova St., Rostov-on-Don 344090, Russia
We consider a model of protecting the confidentiality and recoverability of data in a distributed storage system. It is assumed that informational blocks are coded into the code blocks. Then the blocks are divided into parts and distributed among repositories of the distributed storage. A modification of the code noising method is constructed which simultaneously provides computational resistance to coalition attacks on confidentiality of stored data. Moreover, the modification also 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.
wiretap channel, distributed secure storage, coalition attack.
PDF file (402 kB)
Yu. V. Kosolapov, F. S. Pevnev, “A method of protected distribution of data among unreliable and untrusted nodes”, Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 19:3 (2019), 326–337
Citation in format AMSBIB
\by Yu.~V.~Kosolapov, F.~S.~Pevnev
\paper A method of protected distribution of data among unreliable and untrusted nodes
\jour Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|