Ideal hierarchical secret sharing schemes
Hierarchical secret sharing is among the most natural generalizations of threshold secret
sharing, and it has attracted a lot of attention since the invention of secret sharing until …
sharing, and it has attracted a lot of attention since the invention of secret sharing until …
Ideal multipartite secret sharing schemes
Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …
which the set of participants is divided into several parts and all participants in the same part …
Ideal multipartite secret sharing schemes
Multipartite secret sharing schemes are those having a multipartite access structure, in
which the set of participants is divided into several parts and all participants in the same part …
which the set of participants is divided into several parts and all participants in the same part …
On secret sharing schemes, matroids and polymatroids
J Martí-Farré, C Padró - Theory of Cryptography Conference, 2007 - Springer
One of the main open problems in secret sharing is the characterization of the access
structures of ideal secret sharing schemes. As a consequence of the results by Brickell and …
structures of ideal secret sharing schemes. As a consequence of the results by Brickell and …
On-line secret sharing
L Csirmaz, G Tardos - Designs, Codes and Cryptography, 2012 - Springer
In a perfect secret sharing scheme the dealer distributes shares to participants so that
qualified subsets can recover the secret, while unqualified subsets have no information on …
qualified subsets can recover the secret, while unqualified subsets have no information on …
On abelian and homomorphic secret sharing schemes
Homomorphic (resp. abelian) secret sharing is a generalization of ubiquitous linear secret
sharing in which the secret value and the shares are taken from finite (resp. abelian) groups …
sharing in which the secret value and the shares are taken from finite (resp. abelian) groups …
Secret sharing schemes for ports of matroids of rank 3
O Farràs - Kybernetika, 2020 - dml.cz
A secret sharing scheme is ideal if the size of each share is equal to the size of the secret.
Brickell and Davenport showed that the access structure of an ideal secret sharing scheme …
Brickell and Davenport showed that the access structure of an ideal secret sharing scheme …
Ideal secret sharing schemes on graph-based -homogeneous access structures
S Janbaz, B Bagherpour, A Zaghian - Transactions on Combinatorics, 2021 - toc.ui.ac.ir
The characterization of the ideal access structures is one of the main open problems in
secret sharing and is important from both practical and theoretical points of views. A graph …
secret sharing and is important from both practical and theoretical points of views. A graph …
Further ideal multipartite access structures from integer polymatroids
Ideal access structures admit ideal secret sharing schemes where the shares have the
minimal size. As multipartite access structures can well mirror the real social organizations …
minimal size. As multipartite access structures can well mirror the real social organizations …
One-adhesive polymatroids
L Csirmaz - arXiv preprint arXiv:1904.07565, 2019 - arxiv.org
Adhesive polymatroids were defined by F. Mat\'u\v {s} motivated by entropy functions. Two
polymatroids are adhesive if they can be glued together along their joint part in a modular …
polymatroids are adhesive if they can be glued together along their joint part in a modular …