On the dealer’s randomness required in secret sharing schemes

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

Volumn 950, Issue , 1995, Pages 35-46

  Blundo, C ^a,b   Gaggia, A Giorgio ^a   Stinson, D R ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; RANDOM PROCESSES;

ACCESS STRUCTURE; COMBINATORIAL DESIGN; CONNECTED GRAPH; LOWER AND UPPER BOUNDS; LOWER BOUNDS; SECRET SHARING SCHEMES; THRESHOLD SCHEMES; UPPER AND LOWER BOUNDS;

GRAPH THEORY;

EID: 84948947435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053422     Document Type: Conference Paper

References (28)

1. J. C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, in “Advances in Cryptology - Crypto ‘88”, S. Goldwasser Ed., “Lecture Notes in Computer Science”, Vol. 403, Springer-Verlag, Berlin, pp. 27-35, 1990.
2. T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Bibliographisches Institut, Zurich, 1985.
3. G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings of AFIPS 1979 National Computer Conference, Vol. 48, New York, NY, pp. 313-317, June 1979.
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”, Vol. 740, Springer-Verlag, Berlin, pp. 149-169, 1993. To appear in Theoretical Computer Science.
5. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, Journal of Cryptology, Voll 8, (1995), pp. 39-64. A prehminary version appeared in “Advances in Cryptology - Eurocrypt ‘92”, Lecture Notes in Computer Science, Vol. 658, R. Rueppel Ed., Springer-Verlag, pp. 1-24, 1993.
6. C. Blundo, A. De Santis, and U. Vaccaro, Randomness in Distribution Protocols, in “21st International Colloquium on Automata, Languages and Programming” (ICALP ‘94), Serge Abiteboul and Eli Shamir Eds., vol. 820 di “Lecture Notes in Computer Science”, Springer-Verlag, Berlin, pp. 568-579, 1994.
7. E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol. 4, No. 2, pp. 123-124, 1991.
8. E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, J. Cryptology, Vol. 5, No. 3, pp. 153-166, 1992.
9. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, A Note on Secret Sharing Schemes, Sequences II: Methods in Communication, Security and Computer Science, Springer-Verlag. Positano, Italy, pp. 335-344, June 1991.
10. R. M. СаросеШ, A. De Santis, L. Gargano, and U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, Vol. 6, No. 3, Pag. 157-169, 1993.
11. I. Csiszár and J. Körner, Information Theory. Coding Theorems for Discrete Mem-oryless Systems, Academic Press, 1981.
12. J. H. Dinitz and D. R. Stinson, Contemporary Design Theory. A Collection of Surveys, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1992.
13. R. G. Gallager, Information Theory and Reliable Communications, John Wiley and Sons, New York, NY, 1968.
14. O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, Proceedings of 19th ACM Symp. on Theory of Computing, pp. 218-229, 1987.
15. R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proceedings of 30th Annual Symposium of Computer Science, pp. 248-255, 1989.
16. M. Ito, A. Saito, and T. Nishizeki, Secret Sharing Scheme Realizing General Access Structure, Proceedings of IEEE Global Telecommunications Conference, Globecom 87, Tokyo, Japan, pp. 99-102, 1987.
17. E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans, on Inform. Theory, Vol. IT-29, No. 1, pp. 35-41, Jan. 1983.
18. D. Križane, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, Proceedings of 20th Annual ACM Symposium on Theory of Computing”, pp. 93-102, 1988.
19. K.M. Martin, New Secret Sharing Schemes from Old, J. Comb. Math. Comb. Comp. Vol. 14, pp. 65-77, 1993.
20. P. J. Schellenberg and D. R. Stinson, Threshold Schemes from Combinatorial Designs, J. Combin. Math, and Combin. Computing, Vol. 5, pp. 143-160, 1989.
21. D. K. Ray-Chaudhuri and R. M. Wilson, Solution of Kirkman’ s Schoolgirl Problem, Amer. Math. Soc. Proc. Symp. Pure Math., Vol. 19, pp. 187-204, 1971.
22. A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, n. 11, pp. 612-613, Nov. 1979.
23. G.J. Simmons, An Introduction to Shared Secret and/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441-497, 1991.
24. D. R. Stinson, New General Lower Bounds on the Information Rate of Secret Sharing Schemes, in “Advances in Cryptology - CRYPTO ‘92”, Ed. E. Brickell, “Lecture Notes in Computer Science”, Vol. 740, Springer-Verlag, Berlin, pp. 170-184, 1993.
25. D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357-390, 1992.
26. D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, IEEE Trans. Inform. Theory Vol. 40 (1994), pp. 118-125.
27. D. R. Stinson, Combinatorial Designs and Cryptography, in “Surveys in Combinatorics, 1993”, K. Walker Ed., Cambridge Univ. Press, pp. 257-287.
28. D. R. Stinson and A. Vanstone, A Combinatorial Approach to Threshold Schemes, SIAM J. Disc. Math., Vol. 1, May 1988, pp. 230-236.