Mutually trusted authority-free secret sharing schemes

Journal of Cryptology

Volumn 10, Issue 4, 1997, Pages 261-289

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

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Secret sharing schemes

Indexed keywords

EID: 0342890136     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900031     Document Type: Article

References (25)

1. J. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. Advances in Cryptology-Crypto '86. Lecture Notes in Computer Science, Vol. 263, pp. 251-260, 1987.
2. J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. Advances in Cryplology-Crypto '88. Lecture Notes in Computer Science, Vol. 403, pp. 27-35, 1990.
3. G. R. Blakley. Safeguarding cryptographic keys. Proceedings ofAFlPS 1979 National Computer Conference, Vol. 48, pp. 313-317, 1979.
4. E. F. Brickell. Some ideal secret sharing schemes.J. Combin. Math. Combin. Comput., 9:105-113, 1989.
5. E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology, 5:153-166, 1992.
6. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes.J. Cryptology, 6:157-167, 1993.
7. E. Dawson and D. Donovan. Shamir's scheme says it all. Proceedings oflFIP/Sec '93, Toronto, pp. 69-80, 1993.
8. [81 Y. G. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAMJ. Discrete Math., 4:667-679, 1994.
9. |9] M. van Dijk. On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr., 6:143-169, 1995.
10. Y. Frankel and Y. Desmedt. Classification of ideal homomorphic threshold schemes over finite Abelian groups. Advances in Cryptohg\-EUROCRYPT '92, Lecture Notes in Computer Science, Vol. 658, pp. 25-34, 1992.
11. [ll| Y. Frankel, Y. Desmedt, and M. Burmester. Non-existence of homomorphic general secret sharing schemes for some key spaces. Advances in Cryptology-Crypto '92, Lecture Notes in Computer Science, Vol. 740, pp. 549-557, 1993.
12. R. G. Gallager. Information Theory and Reliable Communication. Wiley, New York, 1968.
13. [131 I. Ingemarsson and G. J. Simmons. A protocol to set up shared secret schemes without the assistance of a mutually trusted party. Advances in Cryptology-EUROCRYPT '90. Lecture Notes in Computer Science, Vol. 473, pp. 266-282, 1991.
14. W.-A. Jackson and K.M. Martin. Geometric secret sharing schemes and their duals. Des. Codes Cryptogr., 4:83-95, 1994.
15. ,[15] W.-A. Jackson and K. M. Martin. Perfect secret sharing schemes on five participants. Des. Codes Cryp-togr., 9:267-286, 1996.
16. W.-A. Jackson and K. M. Martin. A combinatorial interpretation of ramp schemes. Aasiralas. J. Combin., 14:51-60, 1996.
17. C.-S. Laih and L. Harn. Generalized threshold cryptosystems. Advances in Cryptology-ASIACRYPT 91. Lecture Notes in Computer Science, Vol. 739, pp. 159-165, 1993.
18. K. M. Martin. New secret sharing schemes from old. J. Combin. Math. Combin. Comput., 14:65-77, 1993.
19. C. Meadows. Some threshold schemes without central key distributors. Congress. Numer., 46:187-199, 1985.
20. A. Shamir. How to share a secret. Comm.ACM, 22(11):6I2-6I3, 1979.
21. (21] G. J. Simmons. The consequences of trust in shared secret schemes. Advances in CryptologyEUKOCRYPT '93. Lecture Notes in Computer Science, Vol. 765, pp. 448-152, 1994.
22. G. J. Simmons and C. Meadows. The role of trust in information protocols. J. Comput. Security, 3:71-84, 1994/95.
23. G. J. Simmons, W.-A. Jackson, and K. Martin. The geometry of shared secret schemes. Bull. Inst. Combin. Appl., 1:71-88, 1991.
24. D. R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr., 2:357-390, 1992.
25. D. R. Stinson. Decomposition constructions for secret sharing schemes. IEEE Trans. Inform. Theory, 40:118-125,1994.