Abstract
A multi-secret sharing scheme is a protocol to share m arbitrarily related secrets s 1, ..., s m among a set of participants \( \mathcal{P} \). In this paper we put forward a general theory of multi-secret sharing schemes by using an information theoretical framework. We prove lower bounds on the size of information held by each participant for various access structures. Finally, we prove the optimality of the bounds by providing protocols.
Partially supported by Italian Ministry of University and Research (M.U.R.S.T.) and by National Council for Research (C.N.R.).
Chapter PDF
Similar content being viewed by others
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.
M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proceedings of 20th Annual ACM Symposium on Theory of Computing, pp. 1–10, 1988.
G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, 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”, E. Brickell Ed., “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, and U. Vaccaro, Efficient Sharing of Many Secrets, in “Proceedings of STACS’ 93 (10th Symp. on Theoretical Aspects of Computer Science)”, P. Enjalbert, A. Finkel, K. W. Wagner Eds., “Lecture Notes in Computer Science”, Vol. 665, Springer-Verlag, Berlin, pp. 692–703, 1993.
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, pp. 57–167, 1993.
I. Csiszár and J. Körner, Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, 1981.
M. Franklin and M. Yung, Communication Complexity of Secure Computation, Proceedings of 24th Annual ACM Symposium on Theory of Computing”, pp. 699–710, 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 Symposium on Theory of Computing, pp. 218–229, 1987.
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.
W.-A. Jackson, K. M. Martin, and C. M. O’Keefe, Multisecret Threshold Schemes, in “Advances in Cryptology-CRYPTO’ 93”, D.R. Stinson Ed., “Lecture Notes in Computer Science”, Vol. 773, Springer-Verlag, Berlin, pp. 126–135, 1994.
W.-A. Jackson, K. M. Martin, and C. M. O’Keefe, A Construction for Multisecret Threshold Schemes, Preprint, 1994.
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.
S. C. Kothari, Generalized Linear Threshold Schemes, in “Advances in Cryptology — CRYPTO’ 84”, G. R. Blakley, D. Chaum Eds., “Lecture Notes in Computer Science”, Vol. 196, Springer-Verlag, Berlin, pp. 231–241, 1985.
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, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357–390, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blundo, C., De Santis, A., Di Crescenzo, G., Gaggia, A.G., Vaccaro, U. (1994). Multi-Secret Sharing Schemes. In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive