## CryptoDB

### Paper: Applying General Access Structure to Proactive Secret Sharing Schemes

Authors: Ventzislav Nikov Svetla Nikova Bart Preneel Joos Vandewalle URL: http://eprint.iacr.org/2002/141 Search ePrint Search Google 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 \cite{CDM99,CDM00,Cra00}. 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 \cite{KW93} deals with arbitrary monotone access structures and not just threshold ones. Stinson and Wei \cite{SW99} 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).
##### BibTeX
@misc{eprint-2002-11664,
title={Applying General Access Structure to Proactive Secret Sharing Schemes},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / proactive and verifiable secret sharing schemes, access structure},
url={http://eprint.iacr.org/2002/141},
note={23rd Symposium on Information Theory in the BENELUX, May 29-31, 2002, Louvain-la-Neuve, Belgium, 197-206. svetla.nikova@esat.kuleuven.ac.be 12113 received 14 Sep 2002, last revised 2 Mar 2003},
author={Ventzislav Nikov and Svetla Nikova and Bart Preneel and Joos Vandewalle},
year=2002
}