An extension of Massey scheme for secret sharing

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 $g$-fold weight enumerator and invariant theory to study the access structure.

💡 Research Summary

The paper presents a systematic generalization of Massey’s linear‑code based secret‑sharing construction, aiming to accommodate more intricate access structures and to clarify their algebraic underpinnings. The authors introduce the concept of a $g$‑fold weight enumerator, a higher‑order enumerator that simultaneously records the weight of $g$ coordinates of a codeword. By doing so, they move beyond the traditional analysis that relies solely on the minimum distance of the underlying code. The central theoretical contribution is a set of dual‑code characterizations: the minimal qualified subsets of participants correspond bijectively to certain subspaces of the dual code $C^{\perp}$. In other words, a coalition can reconstruct the secret if and only if the indices of its shares span a subspace that contains a non‑zero vector of $C^{\perp}$ with support limited to those indices. This dual‑code perspective extends Massey’s original result, which linked qualified sets to the support of minimum‑weight dual codewords, by incorporating the richer structure captured by the $g$‑fold enumerator.

To analyze the invariance of the access structure under code automorphisms, the authors apply invariant theory. They demonstrate that the $g$‑fold weight enumerator is invariant under the automorphism group of the code, and consequently the access structure remains unchanged under any equivalent transformation of the code. This property is valuable for practical design, because it allows the system designer to select any code from an equivalence class without altering the security policy.

The paper provides concrete examples using Reed–Solomon codes and their duals. For $g=1,2,3$, the authors construct the extended Massey schemes, compute the corresponding access structures, and enumerate the minimal qualified sets. The experiments reveal that increasing $g$ refines the access structure: more nuanced coalitions become qualified, and the size of minimal qualified sets can shrink dramatically. However, the trade‑off is a higher reconstruction complexity and a shift in information‑rate parameters.

Security analysis is carried out from an information‑theoretic standpoint. The authors prove that any unqualified coalition gains negligible mutual information about the secret, preserving perfect secrecy. They also discuss resistance to algebraic attacks such as linear decoding or syndrome‑based reconstruction, showing that the combined constraints of the dual code’s minimum distance and the $g$‑fold weight enumerator impose stricter bounds than in the original Massey scheme.

In the concluding section, the authors argue that the introduced framework—combining $g$‑fold weight enumerators with invariant‑theoretic tools—offers a versatile toolkit for designing secret‑sharing systems with dynamic or hierarchical access policies. Potential applications include blockchain‑based key management, distributed ledger confidentiality, and any scenario where multiple, possibly overlapping, authority groups must be accommodated. Overall, the work enriches the theoretical foundation of linear‑code secret sharing and provides concrete guidance for implementing more flexible, secure, and mathematically grounded sharing schemes.