|
Published Articles >> Table of Contents >> Abstract
18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1
p. 208
Enhancing the Efficiency of (v, r, n)-Fairness Secret Sharing Scheme
Ren-Junn Hwang, Tamkang University, Taipei, Taiwan
Chin-Chen Chang, National Chung Cheng University, Chiayi, Taiwan
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2004.1283912
Send link to a friend
| Abstract |
|
An efficient (v, r, n)-fairness secret sharing scheme is
proposed in this paper. In the proposed scheme, all participants
have an equal probability to recover the shared
secret, even if there exist v cheaters, v<r/2, among the n
participants. To put it another way, if the cheater can
recover the shared secret in the recovery phase, the honest
participants can recover the shared secret too, and
vice versa. Furthermore, we show that our (v, r,
n)-fairness secret sharing scheme is more efficient than
Lee and Laih's scheme.
|
 Additional Information
|
Citation:
Ren-Junn Hwang, Chin-Chen Chang,
"Enhancing the Efficiency of (v, r, n)-Fairness Secret Sharing Scheme,"
aina,
p. 208,
18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1,
2004
|
|
