Authors: Iulian Oleniuc, Alexandru Ioniță
Keywords: Cryptography, Attribute-Based Encryption, Linear Secret Sharing, Monotone Span Programs, Boolean Circuits.
Abstract
This paper offers a gentle introduction into the realm of monotone span programs and their connection with linear secret sharing schemes and attribute-based encryption while emphasizing the cryptographic importance of finding efficient MSPs for representing complex access structures. We provide a proof that there is no ideal LSSS for Boolean circuits, thus tackling the open problem of finding LSSSes of non-exponential size for Boolean circuits. Moreover, we present an application of our proof to graph access structures and a backtracking approach to finding efficient MSPs for given access structures.
Iulian Oleniuc
Alexandru Ioan Cuza University of Iasi
11 Carol I Boulevard, Iasi 700506, Romania
E-mail:
Alexandru Ioniță
ORCID:
https://orcid.org/0000-0002-9876-6121
Alexandru Ioan Cuza University of Iasi;
Simion Stoilow Institute of Mathematics of the Romanian Academy
11 Carol I Boulevard, Iasi 700506, Romania
E-mail:
DOI
https://doi.org/10.56415/csjm.v33.06
Fulltext

–
0.32 Mb