loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007)
A Proactive Secure Multisecret Sharing Threshold Scheme
Haier International Training Center, Qingdao, China
July 30-August 01
ISBN: 0-7695-2909-7
Feng Li, Shandong University, China
Jianwei Shang, Shandong University, China
Daxing Li, Shandong University, China
This paper presents a new proactive secure multisecret sharing threshold scheme. In the scheme, participants can share multiple secrets and compute sub-secret for rebuilding efficiently and securely, and sub-secret hold by participant is verifiable. The scheme uses verifiable secret sharing technique to against cheating by dealer and cheating by participants. Our scheme is proactive secure, participants will update the sub-secret periodically without dealer?s intervention, old sub-secret will be obsolete and adversary can?t get any useful information from these. At the end, it is demonstrated that the scheme is correct, secure and efficient.
Index Terms:
proactive security, multisecret sharing, discrete logarithm problem, threshold scheme.
Citation:
Feng Li, Jianwei Shang, Daxing Li, "A Proactive Secure Multisecret Sharing Threshold Scheme," snpd, vol. 1, pp.105-110, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.