A Characterization of Ideal Weighted Secret Sharing Schemes

TL;DR

This paper characterizes when compositions of indecomposable ideal weighted threshold access structures result in weighted schemes, providing a complete classification using game-theoretic methods.

Contribution

It offers an exact characterization of which compositions of indecomposable ideal access structures are weighted, filling a key gap in the theory.

Findings

Identifies conditions under which compositions are weighted

Provides an if and only if characterization of ideal weighted threshold schemes

Uses game-theoretic techniques for the analysis

Abstract

Beimel, Tassa and Weinreb (2008) and Farras and Padro (2010) partially characterized access structures of ideal weighted threshold secret sharing schemes in terms of the operation of composition. They classified indecomposable ideal weighted threshold access structures, and proved that any other ideal weighted threshold access structure is a composition of indecomposable ones. It remained unclear which compositions of indecomposable weighted threshold access structures are weighted. In this paper we fill the gap. Using game-theoretic techniques we determine which compositions of indecomposable ideal access structures are weighted, and obtain an if and only if characterization of ideal weighted threshold secret sharing schemes.