Abstract
We consider secret sharing schemes which, through an initial issuing of shares to a group of participants, permit a number of different secrets to be protected. Each secret is associated with a (potentially different) access structure and a particular secret can be reconstructed by any group of participants from its associated access structure without the need for further broadcast information. We consider ideal secret sharing schemes in this more general environment. In particular, we classify the collections of access structures that can be combined in such an ideal secret sharing scheme and we provide a general method of construction for such schemes. We also explore the extent to which the results that connect ideal secret sharing schemes to matroids can be appropriately generalized.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Beimel and B. Chor. Universally ideal secret sharing schemes. Advances in Cryptology—CRYPTO '92. Lecture Notes in Computer Science, Vol. 740, pp. 183–195. Springer-Verlag, Berlin, 1993.
B. Blakley, G. R. Blakley, A. H. Chan, and J. Massey. Threshold schemes with disenrollment. Advances in Cryptology—CRYPTO '92. Lecture Notes in Computer Science, Vol. 740, pp. 540–548. Springer-Verlag, Berlin, 1993.
R. Blom. An optimal class of symmetric key generation systems. Advances in Cryptology—EUROCRYPT '84. Lecture Notes in Computer Science, Vol. 209, pp. 335–338. Springer-Verlag, Berlin, 1984.
C. Blundo and A. Cresti. Space requirements for broadcast encryption. Presented at EUROCRYPT '94, 1994.
C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully dynamic secret sharing schemes. Advances in Cryptology—CRYPTO '93. Lecture Notes in Computer Science, Vol. 773 pp. 110–125.
C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia, and U. Vaccaro. Multi-secret sharing schemes. Advances in Cryptology—CRYPTO '94. Lecture Notes in Computer Science, Vol. 839, pp. 150–163. Springer-Verlag, Berlin, 1994.
C. Blundo, A. De Santis, A. Herzberg, and S. Kutten, Perfectly-secure key distribution for dynamic conferences. Advances in Cryptology—CRYPTO '92. Lecture Notes in Computer Science, Vol. 740, pp. 471–486.
C. Blundo, A. De Santis, and U. Vaccaro. Efficient sharing of many secrets. Proc. STACS '93. Lecture Notes in Computer Science, Vol. 665 pp. 692–703. Springer-Verlag, Berlin, 1993.
E. F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput., 9:105–113, 1989.
E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology, 4:123–134, 1991.
M. Franklin and M. Yung. Communication complexity of secure computation. Proc. 24th ACM Symp. on the Theory of Computing (STOC), pp. 699–710, 1992.
W.-A. Jackson and K. M. Martin. Combinatorial models for perfect secret sharing schemes. J. Combin. Math. Combin. Comput., to appear.
W.-A. Jackson and K. M. Martin. Efficient constructions for one sharing of many secrets. PM95-003, Pure Mathematics Preprint Series, University of Adelaide.
W.-A. Jackson, K. M. Martin, and C. M. O'Keefe. Multisecret threshold schemes. Advances in Cryptology—CRYPTO '93. Lecture Notes in Cpmputer Science, Vol. 773, pp. 126–135. Springer-Verlag, Berlin, 1994.
W.-A. Jackson, K. M. Martin, and C. M. O'Keefe. A construction for multisecret threshold schemes. PM95-004, Pure Mathematics Preprint Series, University of Adelaide.
E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Trans. Inform. Theory, 29:35–41, 1983.
C.-S. Laih, L. Harn, J.-Y. Lee, and T. Hwang. Dynamic threshold scheme based on the definition of cross-product in an N-dimensional linear space. Advances in Cryptology—CRYPTO '89. Lecture Notes in Computer Science, Vol. 435, pp. 286–297. Springer-Verlag, Berlin, 1990.
K. M. Martin. New secret sharing schemes from old. J. Combin. Math. Combin. Comput., 14:65–77, 1993.
K. M. Martin. Untrustworthy participants in secret sharing schemes. Proc. 3rd IMA Conf. on Cryptography and Coding, pp. 255–264, 1993.
T. Matsumoto and H. Imai. On the key predistribution system: a practical solution to the key distribution problem. Advances in Cryptology—CRYPTO '87. Lecture Notes in Computer Science, Vol. 293, pp. 185–193. Springer-Verlag, Berlin, 1988.
R. J. McEliece and D. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9):583–584, 1981.
J. G. Oxley. Matroid Theory. Oxford University Press, Oxford, 1992.
C. Schulze. Multifunctional shared secret schemes. Preprint, 1994.
P. D. Seymour. On secret-sharing matroids. J. Combin. Theory Ser. B, 56:69–73, 1992.
G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. In Contemporary Cryptology, pp. 441–497. Edited by G. J. Simmons. IEEE Press, New York, 1991.
H.-M. Sun and S.-P. Shieh. On dynamic threshold schemes. Inform. Process. Lett., 52:201–206, 1994.
T. Uehara, T. Nishizeki, and K. Nakamura. A secret sharing system with matroidal access structure. Trans. IECE Japan, J69-A 9:1124–1132, 1986.
D. Welsh. Codes and Cryptography. Clarendon Press, Oxford, 1988.
Author information
Authors and Affiliations
Additional information
Communicated by Douglas R. Stinson
The work of the second and third authors was supported by the Australian Research Council.
Rights and permissions
About this article
Cite this article
Jackson, WA., Martin, K.M. & O'Keefe, C.M. Ideal secret sharing schemes with multiple secrets. J. Cryptology 9, 233–250 (1996). https://doi.org/10.1007/BF00189262
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00189262