Changing thresholds in the absence of secure channels

Journal of Research and Practice in Information Technology

Volumn 31, Issue 2, 1999, Pages 34-42

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

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Geometrical Secret Sharing; Secret Sharing; Shamir Secret Sharing; Threshold Changeable Secret Sharing

Indexed keywords

EID: 33747469206     PISSN: 1443458X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. BLAKLEY, G.R. (1979): Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48:313-317.
2. BLAKLEY, B., BLAKLEY, G.R., CHAN, A.H. and MASSEY, J. (1993): Threshold schemes with disenrolment. Advances in Cryptology - CRYPTO '92, LNCS, 740:540-548.
3. BLAKLEY, G.R. and MEADOWS, C. (1985): Security of ramp schemes. Advances in Cryptology - Proceedings of CRYPTO '84, LNCS, 196:242-268.
4. BLUNDO, C., CRESTI, A., DE SANTIS, A. and VACCARO, U. (1993): Fully dynamic secret sharing schemes. Advances in Cryptology - CRYPTO '93, LNCS, 773:110-125.
5. CAPOCELLI, R., DE SANTIS, A., GARGANO, L. and VACCARO, U. (1992): On the size of shares for secret sharing schemes. Advances in Cryptology - CRYPTO '91, LNCS, 576: 101-113.
6. also, Journal of Cryptology, vol. 6, no. 3, pp. 157-167, 1993.
7. DESMEDT, Y. (1994): Threshold cryptography. European Trans. on Telecommunications, 5(41):449-457.
8. DESMEDT, Y. and JAJODIA, S. (1998): Redistributing secret shares to new access structures and its applications. Preprint.
9. JACKSON, W.-A. and MARTIN, K.M. (1994): Geometric secret sharing schemes and their duals. Des. Codes Cryptogr., 4:83-95.
10. JACKSON, W.-A. and MARTIN, K.M. (1996): A combinatorial interpretation of ramp schemes. Australasian Journal of Combinatorics, 14:51-60.
11. HERZBERG, A., JARECKI, S., KRAWCZYK, H. and YUNG, M. (1995): Proactive secret sharing or: how to cope with perpetual leakage. Advances in Cryptology - CRYPTO '95, LNCS, 963:339-352.
12. HIRSCHFELD, J.W.P. (1979): Protective geometries over finite fields. Clarendon Press, Oxford, 1979.
13. KARNIN, E., GREENE, J. and HELLMAN, M. (1983): On secret sharing systems. IEEE Transactions on Information Theory, vol. IT-29: 35-41.
14. MARTIN, K.M. (1993): Untrustworthy participants in secret sharing schemes. Cryptography and Coding III, Oxford University Press, 255-264.
15. MARTIN, K.M., SAFAVI-NAINI, R. and WANG, H. (1998): Bounds and techniques for efficient redistribution of secret shares to new access structures. Preprint.
16. SHAMIR, A. (1979): How to share a secret. Communications of the ACM, 22:612-613.
17. SIMMONS, G. (1990): How to (really) share a secret. Advances in Cryptology - CRYPTO '88, LNCS, 403: 390-448.
18. STINSON, D.R. (1992): An explication of secret sharing schemes. Des. Codes Cryptogr., 2:357-390.