Cryptology ePrint Archive: Report 2004/282

New Monotone Span Programs from Old

Ventzislav Nikov and Svetla Nikova

Abstract: In this paper we provide several known and one new constructions of new linear secret sharing schemes (LSSS) from existing ones. This constructions are well-suited for didactic purposes, which is a main goal of this paper. It is well known that LSSS are in one-to-one correspondence with monotone span programs (MSPs). MSPs introduced by Karchmer and Wigderson, can be viewed as a linear algebra model for computing a monotone function (access structure). Thus the focus is in obtaining a MSP computing the new access structure starting from the MSPs that compute the existing ones, in the way that the size of the MSP after the transformation is well defined. Next we define certain new operations on access structures and prove certain related properties.

Category / Keywords: linear secret sharing schemes, monotone span programs

Date: received 31 Oct 2004

Contact author: svetla nikova at esat kuleuven ac be

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20041103:074604 (All versions of this report)

Short URL: ia.cr/2004/282

Discussion forum: Show discussion | Start new discussion