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 …
Two constructions on limits of entropy functions
F Matus - IEEE Transactions on Information Theory, 2006 - ieeexplore.ieee.org
The correspondence between the subvectors of a random vector and their Shannon
entropies gives rise to an entropy function. Limits of the entropy functions are closed to …
entropies gives rise to an entropy function. Limits of the entropy functions are closed to …
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 …
Lecture notes in secret sharing
C Padró - Cryptology ePrint Archive, 2012 - eprint.iacr.org
These are basically the lecture notes for the short course" Applications of Combinatorics to
Information-Theoretic Cryptography", Central European University, Budapest, May-June …
Information-Theoretic Cryptography", Central European University, Budapest, May-June …
Matroids can be far from ideal secret sharing
In a secret-sharing scheme, a secret value is distributed among a set of parties by giving
each party a share. The requirement is that only predefined subsets of parties can recover …
each party a share. The requirement is that only predefined subsets of parties can recover …
Improving the linear programming technique in the search for lower bounds in secret sharing
We present a new improvement in the linear programming technique to derive lower bounds
on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds …
on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds …
[HTML][HTML] Secret-sharing schemes for very dense graphs
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can
reconstruct the secret while every independent set in the graph does not get any information …
reconstruct the secret while every independent set in the graph does not get any information …
Improving the linear programming technique in the search for lower bounds in secret sharing
We present a new improvement in the linear programming technique to derive lower bounds
on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds …
on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds …
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 …
A generalized information theoretical model for quantum secret sharing
CM Bai, ZH Li, TT Xu, YM Li - International Journal of Theoretical Physics, 2016 - Springer
An information theoretical model for quantum secret sharing was introduced by H. Imai et
al.(Quantum Inf. Comput. 5 (1), 69–80 2005), which was analyzed by quantum information …
al.(Quantum Inf. Comput. 5 (1), 69–80 2005), which was analyzed by quantum information …