Type:
Conference Paper›Invited and refereed articles in conference proceedings
Authored by:
Poovendran, Radha., Corson, Scott M., Baras, John S.
Conference date:
June 20-25, 1999
Conference:
1999 IEEE Information Theory and Communications Workshop, pp.8
Full Text Paper:
Abstract:
We present a scheme for shared secret generations by n members that combines the contributions the members in a fashion such that the individual contribution of each member is not exposed to anyone- including other members. We note that for an external attacker trying to break the n L-bit secrets of the members, the effective search space dimension is nL, meaning that all n keys must be broken simultaneously in order to crack system integrity. We also note that the scheme provides "Unconditional Secrecy"[1].