Author:
Blundo Carlo,Santis Alfredo,Vaccaro Ugo
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. J. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, Lecture Notes in Computer Science, 403:27–35, 1990.
2. G. R. Blakley, Safeguarding Cryptographic Keys, AFIPS Conference Proceedings, 48:313–317, 1979.
3. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, in “Advances in Cryptology — EUROCRYPT 92”, Ed. R. Rueppel, “Lecture Notes in Computer Science”, Springer-Verlag, (to appear).
4. C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in “Advances in Cryptology — CRYPTO 92”, Ed. E. Brickell, “Lecture Notes in Computer Science”, Springer-Verlag, (to appear).
5. E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, in “Advances in Cryptology — CRYPTO 90”, “Lecture Notes in Computer Science”, Springer-Verlag. To appear in J. Cryptology.
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献