Paper 2002/141 Original: eprint.iacr.org/2002/141 ↗
Applying General Access Structure to Proactive Secret Sharing Schemes
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).
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2003-03-02: last updated
- 2002-09-17: published
- Short URL
- https://ia.cr/2002/141
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}