Journal of Universal Computer Science391023-103

Ding, C.

Laihonen, T.

Renvall, A.

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

Ding,Cunsheng

Laihonen,Tero

Renvall,Ari

ARPHA Preprints

Linear Multisecret-Sharing Schemes and Error-Correcting Codes

ARPHA OAI-PMH Endpoint

Ding, Cunsheng

Hong Kong University of Science and Technology Institutional Repository

Linear multi-secret sharing schemes and errorcorrecting codes

Laihonen, Tero

Renvall, Ari

ZENODO

ScholarBank@NUS

Linear multisecret-sharing schemes and error-correcting codes

Linear multisecret-sharing schemes and error-correcting codes

Abstract

Similar works

Full text

Available Versions

ARPHA Preprints

ARPHA OAI-PMH Endpoint

Hong Kong University of Science and Technology Institutional Repository

ZENODO

ScholarBank@NUS