Paper 2002/141
Applying General Access Structure to Proactive Secret Sharing Schemes
Ventzislav Nikov, Svetla Nikova, Bart Preneel, and Joos Vandewalle
Abstract
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).
Note: Corrected Version
Metadata
- Available format(s)
-
PDF
PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. 23rd Symposium on Information Theory in the BENELUX, May 29-31, 2002, Louvain-la-Neuve, Belgium, 197-206.
- Keywords
- access structure
- Contact author(s)
- svetla nikova @ esat kuleuven ac be
- History
- 2003-03-02: last of 3 revisions
- 2002-09-17: received
- See all versions
- Short URL
- https://ia.cr/2002/141
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2002/141,
author = {Ventzislav Nikov and Svetla Nikova and Bart Preneel and Joos Vandewalle},
title = {Applying General Access Structure to Proactive Secret Sharing Schemes},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/141},
year = {2002},
url = {https://eprint.iacr.org/2002/141}
}
