Please use this identifier to cite or link to this item:
|Title:||Linear multisecret-sharing schemes and error-correcting codes|
|Authors:||Ding, C. |
|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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.