Data sharing based on error-correcting codes

Abstract

Secret sharing protocols are used for distributed storing of information. Most often such information are secret keys or passwords of any user. Secret sharing protocols are designed to solve the problem of storing information so that those groups of people, who are allowed to know the secret, can restore the secret, and those groups that are not allowed to know the secret, are not able to recover even by brute-force. More popular threshold secret sharing scheme is Shamir’s distribution scheme. The idea of Shamir's scheme is the fact that for the interpolation polynomial of degree k-1, k points are required. Shamir’s sharing scheme was originally designed for distribution of secret keys. For large amounts of data, sharing and restore processes are very slow. Thus, it is necessary to have a faster threshold secret sharing scheme. Since the secret scheme is based on the redundant information, and error-correcting codes provide redundancy, the idea was came to build a distribution scheme based on these codes. This article describes a new system of secret sharing on the basis of error-correcting codes. The purpose of the study is to develop a high-performance system which will use a different error-correcting code.