Secret Sharing Limitations Over Boolean Circuits
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 pr...
Saved in:
| Main Authors: | Iulian Oleniuc, Alexandru Ioniță |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2025-04-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | https://www.math.md/files/csjm/v33-n1/v33-n1-(pp113-129).pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Universal share-based two-in-one multi-image secret sharing scheme by rotating random grids
by: Dipak K. Rabari, et al.
Published: (2025-03-01) -
On the structure, complexity, and depth of the circuits over the basis {&,˅} realizing step Boolean functions
by: S.A. Lozhkin, et al.
Published: (2020-09-01) -
A Construction Method of (2, 3) Visual Cryptography Scheme
by: Peng Li, et al.
Published: (2020-01-01) -
On the implementation of Boolean functions by contact circuits with uniform width 3
by: K.A. Popkov
Published: (2020-09-01) -
The (<i>n</i>, <i>n</i>) Visual Multi-Secrets Sharing Scheme with Abilities of OR and XOR Decryption
by: An-Hui Lo, et al.
Published: (2025-03-01)