Bounds and techniques for efficient redistribution of secret shares to new access structures

Computer Journal

Volumn 42, Issue 8, 1999, Pages 638-649

  Martin, Keith M ^a   Safavi Naini, Rei ^b   Wang, Huaxiong ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; SECURITY OF DATA;

REDISTRIBUTION PROTOCOLS; SECRET SHARING SCHEME; SHARE REDISTRIBUTION;

DATA COMMUNICATION SYSTEMS;

EID: 0033351734     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/42.8.638     Document Type: Article

References (24)

1. Blakley, G. R. (1979) Safeguarding cryptographic keys. In Proc. AFIPS 1979 National Computer Conf., vol. 48, pp. 313-317.
2. Shamir, A. (1979) How to share a secret. Commun. ACM, 22, 612-613.
3. Cover, T. M. and Thomas, J. A. (1991) Elements of Information Theory. John Wiley & Sons, New York.
4. Stinson, D. R. (1992) An explication of secret sharing schemes. Des. Codes Cryptogr., 2, 357-390.
5. Ingemarsson, I. and Simmons. G. J. (1991) A protocol to set up shared secret schemes without the assistance of a mutually trusted party. In Adv. in Cryptology - EUROCRYPT'90 (Lect. Notes Comput. Sci., vol. 473), pp. 266-282. Springer-Verlag, Berlin.
6. Jackson, W.-A., Martin, K. M. and O'Keefe, C. M. (1997) Mutually trusted authority free secret sharing schemes. J. Cryptol, 10, 261-289.
7. Brickell, E. F. (1989) Some ideal secret sharing schemes. J. Comb. Math. Comb. Comput., 9, 105-113.
8. Simmons, G. J., Jackson, W.-A. and Martin, K. (1991) The geometry of shared secret schemes. Bull. Inst. Combin. Appl., 1, 71-88.
9. van Dijk, M. (1995) On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr., 6, 143-169.
10. Boneh, D. and Franklin, M. (1997) Efficient generation of shared RSA keys. In Adv. in Cryptology - CRYPTO'97 (Lect. Notes Comput. Sci., vol. 1294), pp. 425-439. Springer-Verlag, Berlin.
11. Desmedt, Y. and Jajodia, S. (1997) Redistributing secret shares to new access structures and its applications. Preprint.
12. Gennaro, R., Jarecki, S., Krawczyk, H. and Rabin, T. (1996) Robust threshold DSS signatures. In Adv. in Cryptology -EUROCRYPT'96 (Lect. Notes Comput. Sci., vol. 1070), pp. 354-371. Springer-Verlag, Berlin.
13. Herzberg, A., Jarecki, S., Krawczyk, H. and Yung, M. (1995) Proactive secret sharing. In Adv. in Cryptology - CRYPTO'95 (Lect. Notes Comput. Sci., vol. 963), pp. 339-352. Springer-Verlag, Berlin.
14. Blundo, C., Giorgia Gaggia, A. and Stinson, D. R. (1997) On the dealer's randomness required in secret sharing schemes. Des. Codes Cryptogr., 11, 235-259.
15. Benaloh, J. (1987) Secret sharing homomorphisms: keeping shares of a secret secret. In Adv. in Cryptology - CRYPTO'86 (Lect. Notes Comput. Sci, vol. 263), pp. 251-260. Springer-Verlag, Berlin.
16. Desmedt, Y. G. and Frankel, Y. (1994) Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM J. Discrete Math., 4, 667-679.
17. Chen, L., Gollmann, D. and Mitchell, C. J. (1997) Key escrow in mutually mistrusting domains. In Proc. of 1996 Cambridge Workshop on Security Protocols (Lect. Notes Comput. Sci., vol. 1189), pp. 139-153. Springer-Verlag, Berlin.
18. Martin, K. M. (1997) Increasing efficiency of international key escrow in mutually mistrusting domains. In Cryptography and Coding (Lect. Notes Comput. Sci., vol. 1355), pp. 221-232. Springer-Verlag, Berlin.
19. Blundo, C., Cresti, A., De Santis, A. and Vaccaro, U. (1994) Fully dynamic secret sharing schemes. In Adv. in Cryptology - CRYPTO'93 (Lect. Notes Comput. Sci., vol. 773), pp. 110-125. Springer-Verlag, Berlin.
20. Blakley, B., Blakley, G. R., Chan, A. H. and Massey, J. (1993) Threshold schemes with disenrollment. In Adv. in Cryptology - CRYPTO'92 (Lect. Notes Comput. Sci., vol. 740), pp. 540-548. Springer-Verlag, Berlin.
21. Martin, K. M. (1993) Untrustworthy participants in secret sharing schemes. Cryptography and Coding III, pp. 255-264. Oxford University Press, Oxford, UK.
22. Blakley, G. R. and Meadows, C. (1985) The security of ramp schemes. In Adv. in Cryptology - CRYPTO'84 (Lect. Notes Comput. Sci., vol. 196), pp. 242-268. Springer-Verlag, Berlin.
23. Jackson, W.-A. and Martin, K. M. (1996) A combinatorial interpretation of ramp schemes. Australas. J. Comb., 14, 51-60.
24. Stinson, D. R. and Wei, R. (1999) An application of ramp schemes to broadcast encryption. Inf. Process. Lett., 69, 131-135.