Changing thresholds in the absence of secure channels

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

Volumn 1587, Issue , 1999, Pages 177-191

  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

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

GENERAL MODEL; GENERIC CONSTRUCTION; SECRET SHARING; SECRET SHARING SCHEMES; SECURE CHANNELS; THRESHOLD CHANGEABLE SECRET SHARING SCHEMES; THRESHOLD PARAMETERS; THRESHOLD SCHEMES;

SECURITY OF DATA;

EID: 84961340536     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48970-3_15     Document Type: Conference Paper

References (17)

1. G. R. Blakley. Safeguarding cryptographic keys. Proceedings of AFIPS 1979 National Computer Conference, 48:313-317, 1979.
2. B. Blakley, G.R. Blakley, A.H. Chan and J. Massey. Threshold schemes with disen- rolment. Advances in Cryptology – CRYPTO’92, Lecture Notes in Comput. Sci., 740:540-548, 1993.
3. G. R. Blakley and C. Meadows. Security of ramp schemes. Advances in Cryptology - Proceedings of CRYPTO’84, Lecture Notes in Computt. Sci., 196:242-268, 1985.
4. C. Blundo, A. Cresti, A. De Santis and U. Vaccaro. Fully dynamic secret sharing schemes. Advances in Cryptology – CRYPTO’93, Lecture Notes in Comput. Sci., 773:110-125, 1993.
5. R. Capocelli, A. Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. Advances in Cryptology – CRYPTO’91, Lecture Notes in Comput. Sci., 576:101-113, 1992. also, Journal of Cryptology, vol. 6, no. 3, pp. 157-167, 1993.
6. Y. Desmedt. Threshold cryptography. European Transactions on Telecommunications, 5(41):449-457, 1994.
7. Y. Desmedt and S. Jajodia. Redistributing secret shares to new access structures and its applications. Preprint.
8. W.-A. Jackson and K.M. Martin. Geometric secret sharing schemes and their duals. Des. Codes Cryptogr., 4:83-95, 1994.
9. W.-A. Jackson and K.M. Martin. A combinatorial interpretation of ramp schemes. Australasian Journal of Combinatorics, 14:51-60, 1996.
10. A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing or: how to cope with perpetual leakage. Advances in Cryptology – CRYPTO ’95, Lecture Notes in Comput. Sci., 963:339-352, 1995.
11. J.W.P. Hirschfeld. Projective geometries over finite fields. Clarendon Press, Oxford, 1979.
12. E. Karnin, J. Greene, and M. Hellman. On secret sharing systems. IEEE Transactions on Information Theory, vol. IT-29: 35-41, 1983.
13. K.M. Martin. Untrustworthy participants in secret sharing schemes. Cryptography and Coding III, Oxford University Press, 255-264, 1993.
14. K.M. Martin, R. Safavi-Naini and H. Wang. Bounds and techniques for efficient redistribution of secret shares to new access structures. Preprint.
15. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
16. G. Simmons. How to (really) share a secret. Advances in Cryptology - CRYPTO’88, Lecture Notes in Comput. Sci., 403:390-448, 1990.
17. D.R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr., 2:357-390, 1992.