Multisecret-sharing schemes and bounded distance decoding of linear codes

ÇALKAVUR S., Sole P.

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, cilt.94, sa.1, ss.107-114, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 94 Sayı: 1
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1080/00207160.2015.1091071
  • Dergi Adı: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.107-114
  • Anahtar Kelimeler: Secret sharing, multisecret-sharing, ideal secret sharing, bounded distance decoding, linear code
  • Kocaeli Üniversitesi Adresli: Evet

Özet

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.