The information rate is the ratio between the size of the secret and the size of the largest share given to any participant.
We derive new limitations on the information rate and the average information rate of secret sharing schemes for access structure represented by graphs.
A secret sharing scheme is a technique to distribute a secret S among a set of participants P in such a way that only qualified subsets of P can reconstruct.
People also ask
What is the KN threshold scheme?
What is an example of a secret sharing scheme?
What is the ideal secret sharing scheme?
What is the 2 out of 3 scheme?
We derive new limitations on the information rate and the average information rate of secret sharing schemes for access structure represented by graphs.
We derive new limitations on the information rate and the average information rate of secret sharing schemes for access structure represented by graphs.
Sep 2, 2016 · Abstract. A secret sharing scheme is non-perfect if some subsets of players that cannot recover the secret value have partial information ...
New bounds on the information rate of secret sharing schemes. Abstract: /spl acute/A secret sharing scheme permits a secret to be shared among participants ...
We present a method to derive information theoretical upper bounds on the information rate and average information rate of perfect secret sharing schemes.
Jul 7, 2010 · Further, not every scheme can be realized with rate one. In this paper we derive new upper bounds for the information rates of quantum secret ...
On the Information Rate of Secret Sharing Schemes (Extended Abstract). Authors: Carlo Blundo · Alfredo De Santis · Luisa Gargano · Ugo Vaccaro. Download: DOI ...