Cryptology ePrint Archive: Report 2015/1139

Secret Sharing Schemes with General Access Structures (Full version)

Jian Liu, Sihem Mesnager, and Lusheng Chen

Abstract: Secret sharing schemes with general monotone access structures have been widely discussed in the literature. But in some scenarios, non-monotone access structures may have more practical significance. In this paper, we shed a new light on secret sharing schemes realizing general (not necessarily monotone) access structures. Based on an attack model for secret sharing schemes with general access structures, we redefine perfect secret sharing schemes, which is a generalization of the known concept of perfect secret sharing schemes with monotone access structures. Then, we provide for the first time two constructions of perfect secret sharing schemes with general access structures. The first construction can be seen as a democratic scheme in the sense that the shares are generated by the players themselves. Our second construction significantly enhance the efficiency of the system, where the shares are distributed by the trusted center (TC).

Category / Keywords: foundations / Secret sharing schemes; general access structures; information rate; orthogonal arrays; resilient functions.

Date: received 24 Nov 2015

Contact author: smesnager at univ-paris8 fr

Available format(s): PDF | BibTeX Citation

Note: This paper will appear in the proceedings of the conference "11th International Conference on Information Security and Cryptology" Inscrypt 2015 (IACR) published by Springer.

Version: 20151126:194018 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]