Polar codes for secret sharing
This work addresses practical security issues in cryptography, such as in banking, by providing a method for secret sharing, though it appears incremental as it applies existing Polar codes to this domain.
The paper tackles the problem of secure secret sharing in cryptography by introducing a scheme based on Polar codes, where secrets are distributed among members such that only specific coalitions can access them, with information sent through channels used to construct the codes.
A secret can be an encrypted message or a private key to decrypt the ciphertext. One of the main issues in cryptography is keeping this secret safe. Entrusting secret to one person or saving it in a computer can conclude betrayal of the person or destruction of that device. For solving this issue, secret sharing can be used between some individuals which a coalition of a specific number of them can only get access to the secret. In practical issues, some of the members have more power and by a coalition of fewer of them, they should know about the secret. In a bank, for example, president and deputy can have a union with two members by each other. In this paper, by using Polar codes secret sharing has been studied and a secret sharing scheme based on Polar codes has been introduced. Information needed for any member would be sent by the channel which Polar codes are constructed by it.