A combinatorial characterization of regular anonymous perfect threshold schemes

Information Processing Letters

Volumn 85, Issue 3, 2003, Pages 131-135

  Miao, Ying ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Combinatorial characterization; Combinatorial problems; Difference family; Information security; Regular; Threshold scheme

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; PROBLEM SOLVING; SET THEORY;

THRESHOLD SCHEMES;

SECURITY OF DATA;

EID: 0037435792     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00368-X     Document Type: Article

References (9)

1. Abel R.J.R. Difference families. The CRC Handbook of Combinatorial Designs. 1996;270-287 CRC Press, Boca Raton, FL.
2. Beth T., Jungnickel D., Lenz H. Design Theory. 2nd edn. 1999;Cambridge Univ. Press, Cambridge.
3. Blakley G.R. Safeguarding cryptographic keys. AFIPS Conf. Proceed. 48:1979;313-317.
4. Hedayat S., Sloane N.J.A., Stufken J. Orthogonal Arrays: Theory and Applications. 1999;Springer, Berlin.
5. Martin K.M. Discrete structures in the theory of secret sharing, Ph.D. Thesis. 1991;University of London.
6. Shamir A. How to share a secret. Comm. ACM. 22:1979;612-613.
7. Simmons G.J. An introduction to shared secret and/or shared control schemes and their application. Contemporary Cryptology. 1991;441-497 IEEE Press.
8. Stinson D.R. Combinatorial designs and cryptography. Survey in Combinatorics. London Math. Soc. Lecture Note Ser. 187:1993;257-287 Cambridge Univ. Press, Cambridge.
9. Stinson D.R., Vanstone S.A. A combinatorial approach to threshold schemes. SIAM J. Discrete Math. 1:1988;230-237.