G. J. Simmons. Robust shared secret schemes. Congressus Numerantium, 68:215--248, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Reusing Shares in Secret Sharing Schemes - Zheng, Hardjono, Seberry (1994) (3 citations) (Correct)
.... of maintaining a secret among w shareholders whereby at least t of them are required to cooperate before the secret can be reproduced was first posed by Shamir [10] and Blakley [3] Since then a number of (t; w) threshold schemes have been suggested by researchers in the field of cryptography [12]. These schemes provide the property that by using any t or more pieces of the shared secret, which are called shares hereafter, the whole shared secret can be derived, while at the same time maintaining that any t Gamma 1 or less shares will be insufficient to derive the shared secret. The ....
G. J. Simmons. Robust shared secret schemes. Congressus Numerantium, 68:215--248, 1989.
Reusing Shares in Secret Sharing Schemes - Zheng, Hardjono, Seberry (1994) (3 citations) (Correct)
No context found.
G. J. Simmons. Robust shared secret schemes. Congressus Numerantium, 68:215--248, 1989.
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