Abstract
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. If any non qualified subset has absolutely no informa- tion about the secret, then the scheme is called perfect. Unfortunately, in this case the size of the shares cannot be less than the size of the secret. Krawczyk [9] showed how to improve this bound in the case of compu- tational threshold schemes by using Rabin’s information dispersal algo- rithms [14], [15].
We show how to extend the information dispersal algorithm for general access structure (we call access structure, the set of all qualified subsets). We give bounds on the amount of information each participant must have. Then we apply this to construct computational schemes for general access structures. The size of shares each participant must have in our schemes is nearly minimal: it is equal to the minimal bound plus a piece of information whose length does not depend on the secret size but just on the security parameter.
Part of this work was done while the author was visiting the Laboratoire d’Informatique of the Ecole Normale Supérieure, France.
Supported by the Centre National de la Recherche Scientifique URA 1327.
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. 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, 1988, pp. 27–35.
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, E. Brickell Ed., Springer-Verlag, pp. 149–169, 1993.
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.
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, pp. 157–169, 1993.
L. Csirmaz, Size of Shares Must Be Large, in “Advances in Cryptology-Eurocrypt’ 94”, Lecture Notes in Computer Science, A. De Santis Ed., Springer-Verlag.
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.
I. Csiszar and J. Körner, Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, 1981.
R. G. Gallager, Information Theory and Reliable Communications, John Wiley & Sons, New York, NY, 1968.
H. Krawczyk, Secret Sharing Made Short, in “Advances in Cryptology — CRYPTO’93”, D. Stinson Ed., “Lecture Notes in Computer Science”, Vol. 773, Springer-Verlag, Berlin, 1994.
K. Kurosawa, W. Ogata, S. Tsujii, Nonperfect secret sharing schemes, in “Advances in Cryptology-AUSCRYPT’ 92”.
K. Kurosawa, W. Ogata, K. Okada, K. Sakano, S. Tsujii, Nonperfect secret sharing schemes and Matroids, in “Advances in Cryptology-EUROCRYPT’ 93”.
M. Naor, and R. M. Roth, Optimal File Sharing in Distributed Networks, Proceedings of 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 515–525.
C. H. Papadimitriou, and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982.
M. O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance, Journal of ACM, Vol. 36, No. 2, 1989, pp. 335–348.
M. O. Rabin, The Information Dispersal Algorithm and its Applications, in “Sequences: Combinatorics, Compression, Security and Transmission”, R. M. Capocelli Ed., Springer-Verlag, 1990, pp. 406–419.
A. Shamir, How to Share a Secret Communications of the ACM, Vol. 22, n. 11, pp. 612–613, Nov. 1979.
D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, IEEE Trans. on Inform. Theory, Vol. IT-40, pp. 118–125, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Béguin, P., Cresti, A. (1995). General Short Computational Secret Sharing Schemes. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_16
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive