### 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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Keywords
linear secret sharing schemesmonotone span programs
Contact author(s)
svetla nikova @ esat kuleuven ac be
History
Short URL
https://ia.cr/2004/282

CC BY

BibTeX

@misc{cryptoeprint:2004/282,
author = {Ventzislav Nikov and Svetla Nikova},
title = {New Monotone Span Programs from Old},
howpublished = {Cryptology ePrint Archive, Paper 2004/282},
year = {2004},
note = {\url{https://eprint.iacr.org/2004/282}},
url = {https://eprint.iacr.org/2004/282}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.