Applying General Access Structure to Proactive Secret Sharing Schemes
Svetla Nikova⋆, Ventzislav Nikov, Bart Preneel, Joos P. L. Vandewalle · IACR Cryptology ePrint Archive · 2002
Verifiable secret sharing schemes (VSS) are secret sharing schemes (SSS) dealing with possible cheating by participants. In this paper we use the VSS proposed by Cramer, Damgard and Maurer [6, 7, 5]. They introduced a purely linear algebraic method to transform monotone span program (MSP) based secret sharing schemes into VSS. In fact, the monotone span program model of Karchmer and Wigderson [14] deals with arbitrary monotone access structures and not just threshold ones. Stinson and Wei [17] proposed a proactive SSS based on threshold (polynomial) VSS. The purpose of this paper is to build unconditionally secure proactive SSS over any access structure, as long as it admits a linear secret sharing scheme (LSSS).