Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/99329
Title: Linear multisecret-sharing schemes and error-correcting codes
Authors: Ding, C. 
Laihonen, T.
Renvall, A.
Keywords: Cryptosystems
Error-correcting codes
Information theory
Issue Date: 1997
Citation: Ding, C.,Laihonen, T.,Renvall, A. (1997). Linear multisecret-sharing schemes and error-correcting codes. Journal of Universal Computer Science 3 (9) : 1023-1036. ScholarBank@NUS Repository.
Abstract: In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharing threshold schemes based on Reed-Solomon codes, generalized Reed-Solomon codes, Bossen-Yau redundant residue codes are described, which can detect and correct cheatings. The relations between linear multisecret-sharing threshold schemes and some threshold schemes for single-secret sharing are pointed out. © Springer Pub. Co.
Source Title: Journal of Universal Computer Science
URI: http://scholarbank.nus.edu.sg/handle/10635/99329
ISSN: 0958695X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

23
checked on Sep 21, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.