Secret Sharing Schemes with Nice Access Structures

Issue title: SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu

Article type: Research Article

Authors: Ding, Cunsheng | Salomaa, Arto

Affiliations: Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China. E-mail: [email protected] | Turku Centre for Computer Science, Lemminkäisenkatu 14 A, 5th floor FIN-20520 Turku, Finland. E-mail: [email protected]

Abstract: Secret sharing schemes, introduced by Blakley and Shamir independently in 1979, have a number of applications in security systems. One approach to the construction of secret sharing schemes is based on coding theory. In principle, every linear code can be used to construct secret sharing schemes. But only well structured linear codes give secret sharing schemes with nice access structures in the sense that every pair of participants plays the same role in the secret sharing. In this paper, we construct a class of good linear codes, and use them to obtain a class of secret sharing schemes with nice access structures.

Keywords: Secret sharing, linear codes, access structures

Journal: Fundamenta Informaticae, vol. 73, no. 1-2, pp. 51-63, 2006