A Linear Construction of Secret Sharing Schemes

@article{Dijk1997ALC,
  title={A Linear Construction of Secret Sharing Schemes},
  author={Marten van Dijk},
  journal={Des. Codes Cryptography},
  year={1997},
  volume={12},
  pages={161-201}
}
In this paper, we will generalize the vector space construction due to Brickell. This generalization, introduced by Bertilsson, leads to secret sharing schemes with rational information rates in which the secret can be computed efficiently by each qualified group. A one to one correspondence between the generalized construction and linear block codes is stated, and a matrix characterization of the generalized construction is presented. It turns out that the approach of minimal codewords by… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 21 extracted citations

Unconditionally Anonymous Ring and Mesh Signatures

Journal of Cryptology • 2015
View 2 Excerpts

The optimal information rate of perfect secret sharing schemes

2011 International Conference on Business Management and Electronic Information • 2011

Linguistic Approach to Cryptographic Data Sharing

2008 Second International Conference on Future Generation Communication and Networking • 2008

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Linear Codes and Secret Sharing

Michael Bertilsson
PhD thesis, Link ̈ oping University • 1993
View 10 Excerpts
Highly Influenced

Minimal codewords and secret sharing

James L. Massey
Proc. 6th Joint Swedish-Russian Int. Workshop on Inf. Th • 1993
View 4 Excerpts
Highly Influenced

Some Ideal Secret Sharing Schemes

EUROCRYPT • 1989
View 4 Excerpts
Highly Influenced

Decomposition constructions for secret-sharing schemes

IEEE Trans. Information Theory • 1994
View 5 Excerpts
Highly Influenced

A duality theorem for incomplete secret sharing schemes, Bulletin of the Institute of Combinatorics and its Application

Marten van Dijk, W.-A. Jackson, K. M. Martin
1997
View 1 Excerpt

The optimal linear worst-case information rate, submitted to Designs

Marten van Dijk
Codes and Cryptography, • 1996
View 2 Excerpts

A duality theorem for incomplete secret sharing schemes

W.-A. Jackson Marten van Dijk, K. M. Martin
Bulletin of the Institute of Combinatorics and its Application • 1995

Similar Papers

Loading similar papers…