A probability model for reconstructing secret sharing under the internet environment

Information Sciences

Volumn 116, Issue 2-4, 1999, Pages 109-127

  Lee, Ching Yun ^a   Ych, Yi Shiung ^b   Chen, Deng Jyi ^a   Ku, Kuo Lung ^b  

^a Natural Chino Tang Universty   (China)

^b Ching Shan Institute of Scine and Ferdmology   (China)

Author keywords

Ciraph tlieorx; Internet; Probability; Secret sharing; Spanning nee

Indexed keywords

COMPUTER PRIVACY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; GRAPH THEORY; INTERNET; MATHEMATICAL MODELS; PROBABILITY; SECURITY OF DATA;

INTERNET SECURITY; SECRET RESONANCE SHARING; SPANNING TREE;

INFORMATION TECHNOLOGY;

EID: 0033148297     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(98)10104-4     Document Type: Article

References (21)

1. B. Schnerer, Applied Cryptography, protocols, Algorithms, and Source Code in C 2nd Ed.,Wiley, New York, 1996
2. R.L. River, A. Shamir, I.M. Adleman, A. method for obtaining digital signatures and public-key cryptosystems, Communication of the ACM 21 121 (1978) 120 126.
3. W.P. Lu, M.K. Sundarshan, Enhanced protocols for Ineratchical encryptioon key management for secure communication in internet environments, cations 40 1992) 658, 670.
4. T. Hwant, W.C. Ku, Repetable key distribution protocols for internet environments, IEEE Transaction on Communications 43 (1995) 147 1949.
5. M.Ho, A.Santo, T. Nishizeki, Secret Shariing SchemeRealizing General Access Structure Proc IEEE Globecom 87, Tokyo, 1987 pp. 99 102
6. C.S. Laih, L. Harn, J.Y. Lee, T. Hwang, Dynamic threshold scheme based on the detinition of cross-product in an N-dimentional linear space. Journal of Information Science and Engineering 7 (1991) 13, 23.
7. H.M. Sun, S.P. Shich, On dynamic threshold schmes Information Processing Letters 52 (1994) 201, 206.
8. A. Shanur, How to share a secret. Communicationof the ACM 22 (1979) 612 613.
9. G.R. Blakley, Safeguarding cryptographic keys, Proceedings of the AFIPS 1979 National Computer Conference. vol, 48, New York, 1979 pp. 313-3154
10. D.R. Stinson, An Explication of Secret Shamay Schciney Design, Codes and Cryptography. vol. 2 1992, pp. 357-390.
11. G.L. Simmons, An Introduction 16 Shared Secret and/or Shared Control Schemes and their Application, Contemporary Cryptolgy, IEEE Press, New Yorm 1997 pp. 441-497.
12. K.K. Aggrawal, S. Rai, Reliability evalution in computer communication networks IEEE Transaction on Reliability R-30 (1981), 32-35.
13. W.R. Kevin, Factoring algorithms for computing K-terminal network reliability, IEEE Transaction on Reliability R-35 (1986) 269-278.
14. S. Hariri, C.S. Raghavendra, WYREI., A synbolic reliability algorithm based on path and cubet methods. IEEE Transaction Computers 30 (1987) 1224-1232.
15. C.S. Raghvendra, V.K.P. Kumar, S. Hariri, Reliability analysis in distributed mesns. IEEE Transaction Computers 37 (1988)352-358.
16. M.S. Lin, D.J. Chen, new jreliability evaluation algorithm for distributed computing systems Journal of Information Science and Engineering8 (19981) 353-391.
17. D.J. Chen, T.H. Huang, Reliability analysis of distributed System based on a fast realibiltiy algorith. IEEE Transaction on Pareallel and Distributed Nust Inst. (2) (1992) 139-154.
18. A. Rosental, A compuyr sceintist looks at realibitly computersitions in Realibity and Faut tree Analysis SLAM. 1978. pp. 133-152
19. V. G. Valiant. The compleay of communcation and reliablity probles. SLAM Normal of Computing 8 (1979) 410-421.
20. O.R. Theologrn. J.G. Cadier. Factoring and regulation her theirf with inspectdd relaed IEEE Transaction on Realibility 40 (1991) 210-217.
21. M.O. Ball. Computational complexity of network rehablity analyis an overview. IEEE. Traaction on Realibity R35- (1989) 230-239.