loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008)
An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme
Adelaide, Australia
January 23-January 24
ISBN: 0-7695-3090-7
An efficient (t, n) threshold multi-secret sharing scheme is proposed in this paper. This scheme has the same power as Yang et al.'s scheme, in which there are secrets to be shared among n participants according to (t, n)-threshold access structure. But it uses the fixed ( )th degree Lagrange interpolation polynomial whenever p ) 1 ( > p 1 t t p or t p > while Yang et al.' scheme employs the ( 1 t ), ( )th degree Lagrange interpolation polynomial when , 1 p t p t p > , respectively. Thus, the computing time and the storage cost of this scheme is less than that of Yang et al.'s scheme.
Citation:
Shi Runhua, Huang Liusheng, Zhong Hong, "An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme," wkdd, pp.580-583, First International Workshop on Knowledge Discovery and Data Mining (WKDD 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.