Multisecret-sharing schemes and bounded distance decoding of linear codes. Issue 1 (2nd January 2017)

• Record Type: Journal Article
• Authors: Çalkavur, Selda; Solé, Patrick
• Is Part Of: International journal of computer mathematics. Volume 94:Issue 1(2017)
• Page Start: 107
• Page End: 114
• Publication Date: 2017-01-02
• Subjects: Secret sharing -- multisecret-sharing -- ideal secret sharing -- bounded distance decoding -- linear code; 94B35 -- 94A60; Computers -- Periodicals; Numerical analysis -- Periodicals; Automation -- Periodicals; 004.0151
• DOI: 10.1080/00207160.2015.1091071
• Languages: English
• ISSNs: 0020-7160

Abstract

ABSTRACT: Error-correcting codes are used to correct errors when messages are transmitted through a noisy communication channel. Bounded distance decoding (i.e. decoding up to the error-correcting capacity) is a method of correcting errors that guarantees unique decoding. Secret sharing is a cryptographic protocol that allows a secret known from a person called the dealer to be distributed to n participants. No single participant knows the secret but some special subsets of participants called coalitions can. In this paper, we present a multisecret-sharing scheme based on an error-correcting code where secret reconstruction is made by using bounded distance decoding of the code. This scheme is ideal in the sense that the size of each secret equals the size of any share. Its security improves on that of multisecret-sharing schemes.