Add to ORKGIn this paper, binary linear codes are used to construct the access structures of a secret sharing scheme. The relationship between the minimal codewords of a linear code and the minimal access structure are shown. Furthermore, we generalize the construction of secret sharing scheme by using semisimple group algebra codes. Finally, we study the access structures of a secret sharing scheme based on group algebra code defined by cyclic group of odd prime order over binary field
Secret sharing has been a subject of study since 1979. In the secret sharing schemes there are some ...
This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using t...
Abstract. In this paper we provide several known and one new constructions of new linear secret shar...
Secret sharing schemes have been studied for over twenty years. An important ap-proach to the constr...
Secret sharing schemes, introduced by Blakley and Shamir independently in 1979, have a number of app...
A secret sharing scheme is a method of distributing a secret among a group of participants in such a...
In this paper, we generalize the vector space construction due to Brickell [5]. This generalization,...
The study of secret sharing schemes was independently initiated by Shamir and Blakely in 1979. Since...
In this paper,, error-correcting codes from perfect nonlinear mappings are constructed, and then emp...
AbstractSecret-sharing is an important topic of cryptography and has applications in information sec...
Secret sharing is an interesting subject of cryptography, and has wide applications in real systems....
Secret sharing has been study for many years and has had a number of real-word applications. There a...
A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some ...
In this thesis, we explain linear secret sharing schemes, in particular multiplicative threshold lin...
Abstract: There are great interests in applications of computer algebra to cryptology. This paper di...
Secret sharing has been a subject of study since 1979. In the secret sharing schemes there are some ...
This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using t...
Abstract. In this paper we provide several known and one new constructions of new linear secret shar...
Secret sharing schemes have been studied for over twenty years. An important ap-proach to the constr...
Secret sharing schemes, introduced by Blakley and Shamir independently in 1979, have a number of app...
A secret sharing scheme is a method of distributing a secret among a group of participants in such a...
In this paper, we generalize the vector space construction due to Brickell [5]. This generalization,...
The study of secret sharing schemes was independently initiated by Shamir and Blakely in 1979. Since...
In this paper,, error-correcting codes from perfect nonlinear mappings are constructed, and then emp...
AbstractSecret-sharing is an important topic of cryptography and has applications in information sec...
Secret sharing is an interesting subject of cryptography, and has wide applications in real systems....
Secret sharing has been study for many years and has had a number of real-word applications. There a...
A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some ...
In this thesis, we explain linear secret sharing schemes, in particular multiplicative threshold lin...
Abstract: There are great interests in applications of computer algebra to cryptology. This paper di...
Secret sharing has been a subject of study since 1979. In the secret sharing schemes there are some ...
This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using t...
Abstract. In this paper we provide several known and one new constructions of new linear secret shar...