2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing A Multisecret Sharing Threshold Scheme August 06-August 08 ISBN: 978-0-7695-3263-9
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2008.59
A threshold sharing scheme is a system that protects a secret (key) among a group of participants in such a way that it can only be reconstructed from pooled information held by some certain number of these authorized participants. In this paper we extend this problem to one where there are multiple secrets which participants need reconstruct using the information they hold. It is unnecessary for dealer to recompute or redistribute the formerly sub-secret when a new participant or a new secret adding into the system. Knowledge signature technique will be used to against dealer cheating and participants cheating. As a result our scheme is more efficient and more secure compare to previous schemes.
Index Terms:
dealer cheating, discrete logarithm problem, multisecret sharing, participant cheating, threshold scheme
Citation:
Yanyan Zhang, "A Multisecret Sharing Threshold Scheme," snpd, pp.279-284, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb