An on-line secret sharing scheme for multi-secrets

Computer Communications

Volumn 21, Issue 13, 1998, Pages 1170-1176

  Hwang, Ren Junn ^a   Chang, Chin Chen ^b  

^a NATIONAL DEFENSE UNIVERSITY   (Taiwan)

^b NATIONAL CHUNG CHENG UNIVERSITY   (Taiwan)

Author keywords

Cryptography; Information security; RSA cryptosystem; Secret sharing scheme; Shamir's (r,n) threshold scheme

Indexed keywords

CRYPTOGRAPHY; DATA COMMUNICATION SYSTEMS; ONLINE SYSTEMS;

ONLINE SECRET SHARING SCHEMES;

SECURITY OF DATA;

EID: 0032163101     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(98)00191-1     Document Type: Article

References (18)

1. A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, in: Advances in Cryptology-Crypto '88, Springer-Verlag, Berlin, 1990, pp. 27-35.
3. G.R. Blakley, Safeguarding cryptographic keys, Proceedings of the National Computer Conference, American Federation of Information Processing Societies 48 (1979) 242-268.
4. B. Blakley, G.R. Blakley, A.H. Chan, J.L. Massey, Threshold scheme with disenrollment, in: Advances in Cryptology-Crypto '92, Springer-Verlag, Berlin, 1993, pp. 540-548.
5. C. Blundo, A. Cresti, D. Santis, U. Vaccaro, Fully dynamic secret sharing schemes, in: Advances in Cryptology-Crypto '93, Springer-Verlag, Berlin, 1994, pp. 110-125.
6. C. Blundo, D. Santis, D. Crescenoz, A.G. Gaggia, U. Vaccaro, Multi-secret sharing schemes, in: Advances in Cryptology-Crypto '94, Springer-Verlag, Berlin, 1994, pp. 150-163.
7. C. Cachin, On-line secret sharing, in: Cryptography and Coding, Springer-Verlag, Berlin, 1994, pp. 190-198.
8. R.M. Capocelli, A.D. Santis, L. Gargano, U. Vaccaro, On the size of shares for secret sharing schemes, in: Advances in Cryptology-Crypto '91, Springer-Verlag, Berlin, 1992, pp. 101-113.
9. C.C. Chang, H.J. Horug, D.J. Buehrer, A cascade exponentiation evaluation scheme based on the Lempel-Ziv-Welch compression algorithm, Journal of Information Science and Engineering 11 (3) (1995) 417-431.
10. L. Csirmaz, The size of a share must be Large, in: Advances in Cryptology Eurocrypt '94, Springer-Verlag, Berlin, 1995, pp. 13-22.
11. D.V. Knuth, The Art of Computer Programming: Vol.2/Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1969.
12. H. Krawczyk, Secret sharing made short, in: Advances in Cryptology-Crypto '93, Springer-Verlag, Berlin, 1994, pp. 113-138.
13. R.G.E. Pinch, On-line multiple secret sharing, Electronics Letters 32 (1996) 1087-1088.
14. A. Shamir, How to share a secret, Communication of ACM 22 (1979) 612-613.
15. R.L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public key cryptosystem, Communication of ACM 21 (1978) 120-126.
16. K.H. Rosen, Elementary Number Theory and Its Applications, Addison-Wesley, MA, 1993.
17. G.J. Simmons, Contemporary Cryptology: The Science of Information Integrity, IEEE Press, New York, 1991.
18. D.R. Stinson, Cryptography: Theory and Practice, CRC Press, Boca Raton, FL, 1995.