A construction for multisecret threshold schemes

Designs, Codes, and Cryptography

Volumn 9, Issue 3, 1996, Pages 287-303

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

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Multiple secrets; Secret sharing schemes; Threshold schemes

Indexed keywords

EID: 12244257224     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf00129770     Document Type: Article

References (9)

1. R. Blom, An Optimal class of symmetric key generation systems. Advances in Cryptology - Eurocrypt '84, Lecture Notes in Computer Science, Vol. 209 (1984) 335-338.
2. C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-secure key distribution for dynamic conferences. Advances in Cryptology - Crypto '92, Lecture Notes in Computer Science, Vol. 740 (1993) 471-486.
3. J. W. P. Hirschfeld: Projective geometries over finite fields, Clarendon Press (1979).
4. W.-A. Jackson and K. M. Martin. Geometric secret sharing schemes and their duals. Des. Codes Cryptogr. Vol. 4 (1994) 83-95.
5. 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 (1994) 126-135.
6. R. Lidl and H. Niederreiter: Finite Fields, Cambridge University Press, Cambridge (1983).
7. T. Matsumoto and H. Imai. On the key predistribution system: A practical solution to the key predistribution problem. Advances in Cryptology: Crypto '87, Lecture Notes in Computer Science, Vol. 293 (1987) 185-193.
8. G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. Contemporary Cryptology: The Science of Information Integrity, IEEE Press (1992).
9. D. R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr. Vol. 2 (1992) 357-390.