Y.Zheng, T. Hardjono, and J. Seberry. Reusing shares in secret sharing schemes. ### ######## #######,  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Mutual Authentication in Wireless Networks - Joos, Tripathi (1997) (Correct)
....then be deceived into incorrectly authenticating a different, possibly malicious principal. There are a number of research areas which address untrustworthy or corrupt servers. Of particular interest are Trust Models [Yah94] Bur89] Group Signatures [Cha91] and Shared Secrets [Sha79] Sta96] [Zhe94]. We suggest reviewing these topics before researching the remaining design goal solutions. 6. Conclusion In this paper, we have identified important and unique problems encountered with mutual authentication and secure communications in wireless distributed systems. These problems manifest ....
Y. Zheng, et. al. "Reusing Shares in Secret Sharing Schemes", The Computer Journal, Vol. 37, No. 3, March 1994, pp. 199-205.
The Problem of Trusted Third Party in Authentication and Digital.. - Levi (Correct)
....by Shamir in 1979 [9] There is significant mathematical theory behind the secret sharing concept. A group of the proposed schemes depends on coding theory and linear analysis [11,13,14] but there are some other schemes based on number theory, complexity theory, numerical analysis and calculus [9,10,12,20]. 4.1. Definitions and Types In a secret sharing system, the set of the subsets of the shareholders, that are allowed to restore the secret, is called the access structure. Threshold schemes constitutes an important part in secret sharing systems. Threshold schemes allow any access structure ....
....have any information about the secret. The threshold value k can be any value between 1 and n, where n is the total number of shareholders. The secret sharing studies have started by devising threshold schemes, therefore the first (actually most of the) secret sharing schemes are threshold schemes [11,12,13,14,20]. Most of the secret sharing schemes support some extra features which become important in some applications. In verifiable secret sharing schemes, the shareholders can make sure that the shares are legitimate, but to achieve this, extra message rounds are necessary and this makes the system ....
[Article contains additional citation context not shown here]
Zheng, Y., T. Hardjono and J. Seberry, "Reusing Shares in Secret Sharing Schemes," The Computer Journal, vol. 37, no. 3, pp. 199 - 205, 1994.
Replicating the Kuperee Authentication Server for Increased.. - Hardjono, al. (1996) (1 citation) Self-citation (Hardjono) (Correct)
....the purpose of authentication using replicated TGSs. The replication approach is based on the use of secret sharing schemes (or threshold schemes) 2, 3] to achieve a minimum consensus of honest TGSs. In the current work we do not present any secret sharing scheme, although the practical scheme of [16] is currently under proposal for Kuperee. The reader is directed to [17] for more information on this topic) Previous solutions such as that in [8] employ a thresholding function to split a parameter (e.g. symmetric key) into a number of shares, t out of M of which is required at least to ....
Y. Zheng, T. Hardjono, and J. Seberry, "Reusing shares in secret sharing schemes," The Computer Journal, vol. 17, pp. 199--205, March 1994.
Digital Image Watermarking for Joint Ownership - Huiping Guo Ghping (2002) (Correct)
No context found.
Y.Zheng, T. Hardjono, and J. Seberry. Reusing shares in secret sharing schemes. ### ######## #######,
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC