Some improved bounds on the information rate of perfect secret sharing schemes
Journal of Cryptology
An explication of secret sharing schemes
Designs, Codes and Cryptography
Geometric secret sharing schemes and their duals
Designs, Codes and Cryptography
On the information rate of perfect secret sharing schemes
Designs, Codes and Cryptography
Perfect Secret Sharing Schemes on Five Participants
Designs, Codes and Cryptography
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Linear Algebra Approach to Secret Sharing Schemes
Selected papers from the Workshop on Information Protection, Error Control, Cryptology, and Speech Compression
New General Lower Bounds on the Information Rate of Secret Sharing Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Construction of Practical Secret Sharing Schemes using Linear Block Codes
ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A General Decomposition Construction for Incomplete SecretSharing Schemes
Designs, Codes and Cryptography
Randomness Required for Linear Threshold Sharing Schemes Defined over Any Finite Abelian Group
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Requirements for Group Independent Linear Threshold Secret Sharing Schemes
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Providing Anonymity in Unconditionally Secure Secret Sharing Schemes
Designs, Codes and Cryptography
Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions
Information Processing Letters
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Weakly-private secret sharing schemes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Optimal complexity of secret sharing schemes with four minimal qualified subsets
Designs, Codes and Cryptography
On matroids and non-ideal secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
In this paper, we will generalize the vector space constructiondue to Brickell. This generalization, introduced by Bertilsson,leads to secret sharing schemes with rational information ratesin which the secret can be computed efficiently by each qualifiedgroup. A one to one correspondence between the generalized constructionand linear block codes is stated, and a matrix characterizationof the generalized construction is presented. It turns out thatthe approach of minimal codewords by Massey is a special caseof this construction. For general access structures we presentan outline of an algorithm for determining whether a rationalnumber can be realized as information rate by means of the generalizedvector space construction. If so, the algorithm produces a secretsharing scheme with this information rate.