How to share a secret with cheaters
Journal of Cryptology
Communications of the ACM
Secret Sharing with Reusable Polynomials
ACISP '97 Proceedings of the Second Australasian Conference on Information Security and Privacy
On Sharing Many Secrets (Extended Abstract)
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
An Anonymous Electronic Voting Protocol for Voting Over The Internet
WECWIS '01 Proceedings of the Third International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS '01)
A new multi-stage secret sharing scheme using one-way function
ACM SIGOPS Operating Systems Review
A practical verifiable multi-secret sharing scheme
Computer Standards & Interfaces
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A Verifiable (t, n) Multiple Secret Sharing Scheme and Its Analyses
ISECS '08 Proceedings of the 2008 International Symposium on Electronic Commerce and Security
Publicly verifiable secret sharing
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Distributed provers with applications to undeniable signatures
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Hi-index | 0.00 |
Most verifiable multi-secret sharing schemes can not distinguish the security classification because of having the common drawback of sharing secrets with the same threshold value. In order to withstand the problem, a novel verifiable dynamic multi-policy secret sharing scheme is proposed, in which the dealer can freely give any sets of group secrets for sharing according to the different threshold values, and the shadows held by the participants are not only reusable but also verifiable. The proposed scheme provides efficient solutions against the malicious dealer and participants. Moreover, the proposed scheme can add new participants and new group secrets. Compared to the current secret sharing scheme, the proposed scheme is more flexible and more practical application.