Ideal secret sharing schemes with multiple secrets

Journal of Cryptology

Volumn 9, Issue 4, 1996, Pages 233-250

  Jackson, Wen Ai ^a   Martin, Keith M ^a   O'Keefe, Christine M ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Ideal secret sharing schemes; Matroids; Multiple secrets

Indexed keywords

EID: 0013229183     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900014     Document Type: Article

References (28)

1. 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.
2. B. Blakley, G. R. Blakley, A. H. Chan, and J. Massey. Threshold schemes with disenrollment./4avances in Cryptology-CRYPTO '92. Lecture Notes in Computer Science, Vol. 740, pp. 540-548. Springer-Verlag, Berlin, 1993.
3. 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.
4. C. Blundo and A. Cresti. Space requirements for broadcast encryption. Presented at EUROCRYPT '94, 1994.
5. 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.
6. C. Blundo, A. De Santis, G. Di Crescenzo, A. Giorgio Gaggia, and U. Vaccaro. Multi-secret sharingschemes. Advances in Cryptology-CRYPTO '94. Lecture Notes in Computer Science, Vol. 839, pp. 150-163. Springer-Verlag, Berlin, 1994.
7. 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.
8. C. Blundo, A. De Santis, and U. Vaccaro. Efficient sharing of many secrets. Proc. STAGS '93. Lecture Notes in Computer Science, Vol. 665 pp. 692-703. Springer-Verlag, Berlin, 1993.
9. E. F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. Combin. Comput., 9:105-113,1989.
10. E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology, 4:123-134, 1991.
11. M. Franklin and M. Yung. Communication complexity of secure computation. Proc. 24th ACM Symp. on the Theory of Computing (STOQ, pp. 699-710, 1992.
12. W.-A. Jackson and K. M. Martin. Combinatorial models for perfect secret sharing schemes. J. Combin. Math. Combin. Comput., to appear.
13. W.-A. Jackson and K. M. Martin. Efficient constructions for one sharing of many secrets. PM95-003, Pure Mathematics Preprint Series, University of Adelaide.
14. W.-A. Jackson, K. M. Martin, and C. M. O'Keefe. Multisecret threshold schemes. Advances in Cryptology-CRYPTO '93. Lecture Notes in Computer Science, Vol. 773, pp. 126-135. Springer-Verlag, Berlin, 1994.
15. 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.
16. E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Trans. Inform. Theory, 29:351, 1983.
17. C.-S. Lain, L. Harn, J.-Y. Lee, and T. Hwang. Dynamic threshold scheme based on the definition of cross-product in an W-dimensiona! linear space. Advances in Cryptology-CRYPTO '89. Lecture Notes in Computer Science, Vol. 435, pp. 286-297. Springer-Verlag, Berlin, 1990.
18. K. M. Martin. New secret sharing schemes from old. J. Combin. Math. Combin. Comput., 14:65-77, 1993.
19. K. M. Martin. Untrustworthy participants in secret sharing schemes. Pmc.3rdIMA Conf. on Cryptography and Coding, pp. 255-264,1993.
20. 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.
21. R. J. McEliece and D. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9):583-584, 1981.
22. J. G. Oxley. Matroid Theory. Oxford University Press, Oxford, 1992.
23. C. Schulze. Multifunctional shared secret schemes. Preprint, 1994.
24. P. D. Seymour. On secret-sharing matroids. J. Combin. Theory Ser. B, 56:69-73, 1992.
25. G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. In Contemporary Cryplology, pp. 441-497. Edited by G. J. Simmons. IEEE Press, New York, 1991.
26. H.-M. Sun and S.-P. Shieh. On dynamic threshold schemes. Inform. Process. Lett., 52:201-206, 1994.
27. T. Uehara, T. Nishizeki, and K. Nakamura. A secret sharing system with matroidal access structure. Trans. IECE Japan, J69-A 9:1124-1132, 1986.
28. D. Welsh. Codes and Cryptography. Clarendon Press, Oxford, 1988.