On the size of shares for secret sharing schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 576 LNCS, Issue , 1992, Pages 101-113

  Capocelli, R M ^a   De Santis, A ^b   Gargano, L ^b   Vaccaro, U ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACCESS STRUCTURE; ACHIEVABLE INFORMATION RATE; CRYPTOGRAPHIC KEY; SAMPLE SPACE; SECRET SHARING SCHEMES; SECURE PROTOCOLS; SHARING SCHEMES;

CRYPTOGRAPHY;

EID: 85029546799     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46766-1_7     Document Type: Conference Paper

References (15)

1. J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, Crypto 88, pp. 27-35.
2. G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313-317, June 1979.
3. E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, to appear.
4. E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, Crypto 90 (Published also as Research Report #106, May 1990, University of Nebraska).
5. I. Csiszár and J. Körner, Information Theory. Coding theorems for discrete mem-oryless systems, Academic Press, 1981.
6. D. Denning, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983.
7. R. G. Gallager, Information Theory and Reliable Communications, John Wiley & Sons, New York, NY, 1968.
8. O. Goldreich, S. Micali, and A. Wigderson, Bow to Play Any Mental Game, Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, pp. 218-229.
9. M. Ito, A. Saito, and T. Nishizeki, Secret Skaring Scheme Realizing General Access Structure, Proc. IEEE Global Telecommunications Conf., Globecom 87, Tokyo, Japan, 1987, pp. 99-102.
10. E. D. Kamin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans, on Inform. Theory, vol. IT-29, no. 1, Jan. 1983, pp. 35-41.
11. S. C. Kothari, Generalized Linear Threshold Schemes, Crypto 84, pp. 231-241.
12. A. Shamir, How to Share a Secret, Communications of the ACM, vol. 22, n. 11, pp. 612-613, Nov. 1979.
13. C. E. Shannon, The Mathematical Theory of Communication, Bell. Syst. J., vol. 27, pp. 379-423, 623-656, July/Oct. 1948.
14. G.J. Simmons, Robust Shared Secret Schemes or “How to be Sure You Have the Right Answer even though You don’t Know the Question”, Congressus Numeran-tium, vol. 8, pp. 215-248, 1989.
15. G.J. Simmons, The Geometry of Shared Secret Schemes, Bulletin of the Institute of Combinatorics and its Applications (ICA), vol. 1, pp. 59-70, Jan. 1991.