Secret sharing schemes from three classes of linear codes

Authors:
J. Yuan;C. Ding
Affiliations:
Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., China;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

On the covering structures of two classes of linear codes from perfect nonlinear functions

IEEE Transactions on Information Theory
Secret sharing schemes from binary linear codes

Information Sciences: an International Journal
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

SIAM Journal on Discrete Mathematics
On a kind of two-weight code

European Journal of Combinatorics

Quantified Score

Hi-index	754.90

Visualization

Abstract

Secret sharing has been a subject of study for over 20 years, and has had a number of real-world applications. There are several approaches to the construction of secret sharing schemes. One of them is based on coding theory. In principle, every linear code can be used to construct secret sharing schemes. But determining the access structure is very hard as this requires the complete characterization of the minimal codewords of the underlying linear code, which is a difficult problem in general. In this paper, a sufficient condition for all nonzero codewords of a linear code to be minimal is derived from exponential sums. Some linear codes whose covering structure can be determined are constructed, and then used to construct secret sharing schemes with nice access structures.