loading...
Enhancing the Efficiency of (v, r, n)-Fairness Secret Sharing Scheme
Fukuoka, Japan March 29-March 31
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2004.128391218th International Conference on Adva ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ren-Junn Hwang, Tamkang University, Taipei, Taiwan
Chin-Chen Chang, National Chung Cheng University, Chiayi, Taiwan
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.
Citation:
Ren-Junn Hwang, Chin-Chen Chang, "Enhancing the Efficiency of (v, r, n)-Fairness Secret Sharing Scheme," aina, vol. 1, pp.208, 18th International Conference on Advanced Information Networking and Applications (AINA'04) Volume 1, 2004
Usage of this product signifies your acceptance of the Terms of Use.