Add to ORKGThe study of secret sharing schemes was independently initiated by Shamir and Blakely in 1979. Since then several other secret sharing schemes were introduced. Many of those schemes are (n,k) threshold systems. In this work we give a survey on secret sharing schemes using linear codes. We analyze Shamir’s scheme with an emphasis on the access structure. We explain Massey’s linear secret sharing scheme and mention its superiority to (n,k) threshold systems
Over the past fourteen years many different types of systems for sharing a secret have been proposed...
A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some ...
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and e...
Secret sharing schemes, introduced by Blakley and Shamir independently in 1979, have a number of app...
Secret sharing schemes have been studied for over twenty years. An important ap-proach to the constr...
A secret sharing scheme is a method of distributing a secret among a group of participants in such a...
In this thesis, four different methods for secret sharing with threshold schemes will be investigate...
A secret sharing scheme is a system designed to share a piece of information or the secret among a g...
In 1979 Shamir and Blakley introduced the concept of secret sharing through threshold schemes. Their...
In this paper,, error-correcting codes from perfect nonlinear mappings are constructed, and then emp...
In this paper, binary linear codes are used to construct the access structures of a secret sharing s...
This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using t...
In recent decades, many researchers have investigated peer-to-peer security and cryptography such as...
Function sharing deals with the problem of distribution of the computation of a function (such as de...
A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) wh...
Over the past fourteen years many different types of systems for sharing a secret have been proposed...
A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some ...
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and e...
Secret sharing schemes, introduced by Blakley and Shamir independently in 1979, have a number of app...
Secret sharing schemes have been studied for over twenty years. An important ap-proach to the constr...
A secret sharing scheme is a method of distributing a secret among a group of participants in such a...
In this thesis, four different methods for secret sharing with threshold schemes will be investigate...
A secret sharing scheme is a system designed to share a piece of information or the secret among a g...
In 1979 Shamir and Blakley introduced the concept of secret sharing through threshold schemes. Their...
In this paper,, error-correcting codes from perfect nonlinear mappings are constructed, and then emp...
In this paper, binary linear codes are used to construct the access structures of a secret sharing s...
This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using t...
In recent decades, many researchers have investigated peer-to-peer security and cryptography such as...
Function sharing deals with the problem of distribution of the computation of a function (such as de...
A secret sharing scheme starts with a secret and then derives from it certain shares (or shadows) wh...
Over the past fourteen years many different types of systems for sharing a secret have been proposed...
A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some ...
In a multisecret sharing scheme, several secret values are distributed among a set of n users, and e...