Ideal threshold schemes from MDS codes

Authors:
Josef Pieprzyk;Xian-Mo Zhang
Affiliations:
Centre for Advanced Computing - Algorithms and Cryptography, Department of Computing, Macquarie University, Sydney, NSW, Australia;Centre for Advanced Computing - Algorithms and Cryptography, Department of Computing, Macquarie University, Sydney, NSW, Australia
Venue:
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Year:
2002

Citing 6
Cited 2

How to share a secret with cheaters

Journal of Cryptology
Coding and information theory

Coding and information theory
Some improved bounds on the information rate of perfect secret sharing schemes

Journal of Cryptology
On sharing secrets and Reed-Solomon codes

Communications of the ACM
How to share a secret

Communications of the ACM
Handbook of Coding Theory

Handbook of Coding Theory

Secret Sharing Schemes with Nice Access Structures

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Secret Sharing Schemes with Nice Access Structures

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

Quantified Score

Hi-index	0.00

Visualization

Abstract

We observe that MDS codes have interesting properties that can be used to construct ideal threshold schemes. These schemes permit the combiner to detect cheating, identify cheaters and recover the correct secret. The construction is later generalised so the resulting secret sharing is resistant against the Tompa-Woll cheating.