On the size of shares for secret sharing schemes

@article{Capocelli1993OnTS,
  title={On the size of shares for secret sharing schemes},
  author={Renato M. Capocelli and Alfredo De Santis and Luisa Gargano and Ugo Vaccaro},
  journal={Journal of Cryptology},
  year={1993},
  volume={6},
  pages={157-167}
}
A secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret, but any nonqualified subset has absolutely no information on the secret. The set of all qualified subsets defines the access structure to the secret. Sharing schemes are useful in the management of cryptographic keys and in multiparty secure protocols. We analyze the relationships among the entropies of the sample spaces from which the shares… CONTINUE READING
Highly Influential
This paper has highly influenced 19 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 160 extracted citations

Secret-Sharing Schemes: A Survey

IWCC • 2011
View 7 Excerpts
Highly Influenced

Secret sharing on trees: problem solved

IACR Cryptology ePrint Archive • 2009
View 4 Excerpts
Highly Influenced

Secret sharing schemes on graphs

IACR Cryptology ePrint Archive • 2005
View 6 Excerpts
Highly Influenced

Mathematical Foundations of Computer Science 2001

Lecture Notes in Computer Science • 2001
View 10 Excerpts
Highly Influenced

The Size of a Share Must Be Large

Journal of Cryptology • 1997
View 7 Excerpts
Highly Influenced

Combinatorial Lower Bounds for Secret Sharing Schemes

Inf. Process. Lett. • 1996
View 4 Excerpts
Highly Influenced

Conjecturally Superpolynomial Lower Bound for Share Size

IACR Cryptology ePrint Archive • 2018
View 5 Excerpts
Highly Influenced

The optimal information rate for graph access structures of nine participants

Frontiers of Computer Science • 2015
View 3 Excerpts
Highly Influenced

Theory of Cryptography

Lecture Notes in Computer Science • 2010
View 4 Excerpts
Highly Influenced

On Matroids and Nonideal Secret Sharing

IEEE Transactions on Information Theory • 2008
View 4 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Generalized Secret Sharing and Monotone Functions

View 10 Excerpts
Highly Influenced

Robust Shared Secret Schemes or \How to be Sure You Have the Right Answer even though You don't Know the Question

G. J. Simmons
Congressus Numerantium, vol. 8, pp. 215{248 • 1989
View 1 Excerpt

Secret Sharing Scheme Realizing General Access Structure

M. Ito, A. Saito, T. Nishizeki
Proceedings of IEEE Global Telecommunications Conference, Globecom 87, Tokyo, Japan • 1987
View 1 Excerpt

orner, Information Theory. Coding theorems for discrete mem- oryless systems

I. Csisz ar, K J.
1981
View 1 Excerpt

Similar Papers

Loading similar papers…