Abstract
The problem we deal with in this paper is the research of upper and lower bounds on the randomness required by the dealer to set up a secret sharing scheme. We give both lower and upper bounds for infinite classes of access structures. Lower bounds are obtained using entropy arguments. Upper bounds derive from a decomposition construction based on combinatorial designs (in particular, t-(v, k, λ) designs). We prove a general result on the randomness needed to construct a scheme for the cycle C n; when n is odd our bound is tight. We study the access structures on at most four participants and the connected graphs on five vertices, obtaining exact values for the randomness for all them. Also, we analyze the number of random bits required to construct anonymous threshold schemes, giving upper bounds. (Informally, anonymous threshold schemes are schemes in which the secret can be reconstructed without knowledge of which participants hold which shares.)
This work has been done while the author was visiting the Department of Computer Science and Engineering of the University of Nebraska-Lincoln, NE-68588, U.S.A..
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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.
T. Beth, D. Jungnickel, and H. Lenz, Design Theory, Bibliographisches Institut, Zurich, 1985.
G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings of AFIPS 1979 National Computer Conference, Vol. 48, New York, NY, pp. 313–317, June 1979.
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.
C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, Journal of Cryptology, Vol. 8, (1995), pp. 39–64. A preliminary version appeared in “Advances in Cryptology — Eurocrypt '92”, Lecture Notes in Computer Science, Vol. 658, R. Rueppel Ed., Springer-Verlag, pp. 1–24, 1993.
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.
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.
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.
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.
R. M. Capocelli, 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.
I. Csiszár and J. Körner, Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, 1981.
J. H. Dinitz and D. R. Stinson, Contemporary Design Theory. A Collection of Surveys, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1992.
R. G. Gallager, Information Theory and Reliable Communications, John Wiley & Sons, New York, NY, 1968.
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.
R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proceedings of 30th Annual Symposium of Computer Science, pp. 248–255, 1989.
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.
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.
D. Krizane, 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.
K.M. Martin, New Secret Sharing Schemes from Old, J. Comb. Math. Comb. Comp. Vol. 14, pp. 65–77, 1993.
P. J. Schellenberg and D. R. Stinson, Threshold Schemes from Combinatorial Designs, J. Combin. Math. and Combin. Computing, Vol. 5, pp. 143–160, 1989.
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.
A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, n. 11, pp. 612–613, Nov. 1979.
G.J. Simmons, An Introduction to Shared Secret and/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441–497, 1991.
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.
D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357–390, 1992.
D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, IEEE Trans. Inform. Theory Vol. 40 (1994), pp. 118–125.
D. R. Stinson, Combinatorial Designs and Cryptography, in “Surveys in Combinatorics, 1993”, K. Walker Ed., Cambridge Univ. Press, pp. 257–287.
D. R. Stinson and A. Vanstone, A Combinatorial Approach to Threshold Schemes, SIAM J. Disc. Math., Vol. 1, May 1988, pp. 230–236.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blundo, C., Gaggia, A.G., Stinson, D.R. (1995). On the dealer's randomness required in secret sharing schemes. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053422
Download citation
DOI: https://doi.org/10.1007/BFb0053422
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive