Evaluation of resistance of code noising in the distributed data storage

This paper considers the model of distributed data storage across multiple storages in an environment where each of the owners of storage facilities can be unfair. To protect data from unauthorized access, the method of code noising is used with a subsequent distribution of code words parts to the corresponding storages. Generally, this method is examined, provided that the protected data are random and uniform. Often, in applied problems, protected data do not satisfy this condition. This paper solves the problem of development of experimental techniques to estimate the resistance of code noising in a case where data are the photographic images of faces and the observer has limited abilities for analysis of data available to him. Experimental results are presented for the factor codes that are based on binary Reed–Muller codes of length 64.