An extension of Massey scheme for secret sharing
Romar dela Cruz, Annika Meyer, Patrick Sol\'e
TL;DR
This paper extends Massey's secret sharing scheme using linear codes, analyzing its access structure through dual codes and invariant theory, providing a deeper understanding of the scheme's properties.
Contribution
It introduces an extended scheme based on Massey's construction and explores its access structure via dual codes and invariant theory, offering new insights.
Findings
Access structure characterized by dual codes
Use of $g$-fold weight enumerator in analysis
Connection established between scheme and invariant theory
Abstract
We consider an extension of Massey's construction of secret sharing schemes using linear codes. We describe the access structure of the scheme and show its connection to the dual code. We use the -fold weight enumerator and invariant theory to study the access structure.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Coding theory and cryptography · graph theory and CDMA systems