Linguistic Extension for Secret Sharing (m, n)-Threshold Schemes

Abstract

The subject of this work is the presentation of a new approach to the expansion of classical cryptographic algorithms used for secret sharing and sharing data, with an additional, linguistic stage for the generation of the secret element. Such a part shall be generated in the form of a linguistic description of the shared data, built by defined sequence grammar. The definition of grammar in this scheme will provide additional information required to reconstruct the secret previously split with any algorithm implementing (m, n)-threshold scheme.