How to build robust shared control systems
From MaRDI portal
Previously, shared control schemes were designed with the eye towards the goal of preventing conspiration of participants. In the paper, however, it is argued that in the real world often this is not enough. For example for threshold (secret sharing) schemes in which any \(m\) out of \(n\) participants can recover the secret usually it is not possible to identify which one of many possible groups of participants actually did it. In such cases secret sharing schemes with sparse access structure can help. The paper deals with the problem of systematic construction of such schemes using ideas from coding theory. Secret sharing schemes based on Reed-Muller and Hamming codes are described and their properties analyzed. Also, some connections between linear codes, designs and secret sharing schemes are established as well.
Recommendations
Cited in
(66)- Secret-sharing with a class of ternary codes
- Two classes of linear codes and their weight distributions
- The weight distribution of a class of two-weight linear codes derived from Kloosterman sums
- Binary linear codes with two or three weights from Niho exponents
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- On some classes of codes with a few weights
- Projective binary linear codes from special Boolean functions
- More constructions of 3-weight linear codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Constructions of several classes of linear codes with a few weights
- Binary linear codes with few weights from Boolean functions
- Linear codes with eight weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- Two-weight or three-weight binary linear codes from cyclotomic mappings
- Few-weight codes over a non-chain ring associated with simplicial complexes and their distance optimal Gray image
- New classes of binary few weight codes from trace codes over a chain ring
- A note on the minimal binary linear code
- Notes on generalized Hamming weights of some classes of binary codes
- Several classes of linear codes with few weights from the closed butterfly structure
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions
- New linear codes with few weights derived from Kloosterman sums
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- A construction of linear codes and strongly regular graphs from \(q\)-polynomials
- The dimension and minimum distance of two classes of primitive BCH codes
- Binary linear codes from vectorial Boolean functions and their weight distribution
- A construction of q-ary linear codes with two weights
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- The optimal linear secret sharing scheme for any given access structure
- Constructing few-weight linear codes and strongly regular graphs
- A construction of binary linear codes from Boolean functions
- Linear codes from a generic construction
- The complexity and randomness of linear multi-secret sharing schemes with non-threshold structures
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- A class of linear codes with a few weights
- A kind of three-weight linear codes
- Constructions of linear codes with two or three weights from vectorial dual-bent functions
- Two classes of few-Lee weight \(\mathbb{Z}_2 [u]\)-linear codes using simplicial complexes and minimal codes via Gray map
- Several classes of linear codes with few weights over finite fields
- The punctured codes of two classes of cyclic codes with few weights
- Optimal binary linear codes from posets of the disjoint union of two chains
- Quantum codes from trace codes
- Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
- Two classes of optimal few-weight codes over \({\mathbb{F}}_q+u{\mathbb{F}}_q\)
- Secret sharing schemes from binary linear codes
- A class of three-weight linear codes over finite fields of odd characteristic
- Linear codes with few weights over finite fields
- The weight distributions of several classes of few-weight linear codes
- A tight upper bound on the number of nonzero weights of a quasi-cyclic code
- Binary linear codes with at most three weights from cyclotomic mappings
- The weight distributions and weight hierarchies of two classes of few-weight linear codes
- A new family of minimal linear codes from simplicial complexes
- Further designs for self-orthogonal and LCD codes developed from functions over finite fields
- Several classes of linear codes with few weights derived from Weil sums
- A class of ternary codes with few weights
- On binomial Weil sums and an application
- Linear codes over \(\mathbb{Z}_{p^2}\) with few-weight from down-sets
- Five-Lee-weight linear codes over \(\mathbb{F}_q + u \mathbb{F}_q\)
- A family of linear codes with few weights and their subfield codes
- Linear codes from arcs and quadrics
- Linear codes with few weights over \(\mathbb{F}_p+u\mathbb{F}_p\)
- Two families of \(\mathbb{Z}_{p^m}\)-linear codes and their applications
- Several classes of optimal linear codes with few weights from simplicial complexes
- Constructions of several classes of linear codes from Weil sums and their secret sharing schemes
- Two classes of two-weight linear codes and their complete weight enumerators
- Linear codes from multivariate functions associated with simplicial complexes
- Several classes of linear codes with at most six weights and their secret sharing schemes
- Two classes of optimal p-ary few-weight codes from down-sets
This page was built for publication: How to build robust shared control systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273533)
