Metode za podjelu tajne

Secret sharing schemes are methods of distributing a secret among a group of participants, each of whom is assigned a share of the secret. The secret can only be reconstructed if a sufficient number of shares are combined. In the first chapter of this thesis, we deal with the basic properties of secret sharing schemes. Moreover, we analyzed various secret sharing schemes and classified them based on their characteristics. We also give examples of their application in numerous fields. The second chapter of the thesis deals with the basic secret sharing schemes: Shamir’s and Blakley’s threshold schemes and the methods that use the Chinese remainder theorem, Mignotte’s and Asmuth-Bloom’s threshold schemes. It has been shown that Shamir’s and Asmuth-Bloom’s schemes are perfect, while the other two methods are not. At the very end of the paper, we describe an implementation of Shamir’s threshold scheme for sharing and reconstructing the password.