Size of broadcast in threshold schemes with disenrollment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2384, Issue , 2002, Pages 71-88

  Barwick, S G ^a   Jackson, W A ^a   Martin, Keith M ^b   Wild, Peter R ^b  

^a UNIVERSITY OF ADELAIDE   (Australia)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION COST; CRYPTOGRAPHIC PRIMITIVES; STORAGE REQUIREMENTS; THRESHOLD SCHEMES;

SECURITY OF DATA;

EID: 23044531980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45450-0_6     Document Type: Conference Paper

References (14)

1. G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48 (1979) 313–317.
2. B. Blakley, G.R. Blakley, A.H. Chan and J.L. Massey. Threshold schemes with disenrollment. In Advances in Cryptology - CRYPTO’92, LNCS 740 Springer-Verlag, Berlin (1993) 540–548.
3. C. Blundo, A. Cresti, A. De Santis and U. Vaccaro. Fully dynamic secret sharing schemes. In Advances in Cryptology – CRYPTO’93, LNCS 773, Springer, Berlin (1993) 110–125.
4. T.M. Cover and J.A. Thomas. Elements of Information Theory, John Wiley & Sons, New York (1991).
5. Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its applications. Preprint (1997).
6. E.D. Karnin, J.W. Greene and M.E. Hellman. On secret sharing systems. IEEE Trans. on Inf. Th., 29 (1983) 35–41.
7. K.M. Martin. Untrustworthy participants in perfect secret sharing schemes. In Cryptography and Coding III, (M.J. Ganley, Ed.) Clarendon Press, Oxford (1993) 255–264.
8. K.M. Martin, J. Pieprzyk, R. Safavi-Naini and H. Wang. Changing thresholds in the absence of secure channels. In Information Security and Privacy – ACISP’99, LNCS 1587, Springer, Berlin (1999) 177–191.
9. K.M. Martin, R. Safavi-Naini and H. Wang. Bounds and techniques for efficient redistribution of secret shares to new access structures. The Computer Journal, 42, No.8 (1999) 638–649.
10. A. Shamir. How to share a secret. Communications of the ACM, 22 (1979) 612–613.
11. C.E. Shannon. Communication theory of secrecy systems. Bell System Tech. Journal, 28 (1949) 656–715.
12. G. J. Simmons. An introduction to shared secret and/or shared control schemes and their application. In Contemporary Cryptology, 441–497. IEEE Press, (1991).
13. D.R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr., 2 (1992) 357–390.
14. Y. Tamura, M. Tada and E. Okamoto. Update of access structure in Shamir’s (k, n)-threshold scheme. Proceedings of The 1999 Symposium on Cryptography and Information Security, Kobe, Japan, January 26–29, (1999).