Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777169 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
Abstract
Secret sharing schemes (SSS) offer efficient methods in protecting a secret data shared in parts by shareholders against unauthorized people. Furthermore, this sharing is formed in a way that only a predesigned minimum number of shareholders can solve the secret by using their shares. Many methods have been developed over the last decades. In this work, we present a novel (l, t + l) threshold secret sharing scheme by using error correcting codes. The security of this scheme is based on the hardness of syndrome decoding problem.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ibrahim Ozbek, Irfan Siap,