How to build robust shared control systems (Q1273533)

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.