The digital signature standard
Communications of the ACM
Information Processing Letters
A concept of designing cheater identification methods for secret sharing
Journal of Systems and Software
Communications of the ACM
An ElGamal-Like Cryptosystem for Enciphering Large Messages
IEEE Transactions on Knowledge and Data Engineering
Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Fully Dynamic Secret Sharing Schemes
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
On Sharing Many Secrets (Extended Abstract)
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
A threshold signature scheme for group communications without a shared distribution center
Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
A novel verifiable dynamic multi-policy secret sharing scheme
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC
Wireless Personal Communications: An International Journal
A high quality image sharing with steganography and adaptive authentication scheme
Journal of Systems and Software
An improved multi-stage (t, n)-threshold secret sharing scheme
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Hi-index | 0.00 |
He and Dawson proposed a multi-stage secret sharing scheme based on one-way function. In that scheme, many secrets are reconstructed stage-by-stage in the dealer's predetermined order, and only one secret shadow is kept by every participant. When all the secrets have been reconstructed, the dealer needs not redistribute fresh shadows to every participant. Later, Harn further improved the He-Dawson scheme to reduce the total number of public values. However, in this paper, we will show that both the He-Dawson scheme and Harn's scheme are one-time-use schemes and that many secrets cannot in fact be reconstructed stage-by-stage. At the same time, we shall also modify the He-Dawson scheme to improve the drawbacks above and show the improved scheme can be applied.