How to share a secret with cheaters
Journal of Cryptology
A new signature scheme based on the DSA giving message recovery
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The Detection of Cheaters in Threshold Schemes
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
An improved algorithm for computing logarithms over and its cryptographic significance (Corresp.)
IEEE Transactions on Information Theory
A new (t, n)-threshold multi-secret sharing scheme
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
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.24 |
Cheating detection is a very important issue for (t,n) threshold schemes. An efficient cheater detection scheme based on quadratic residues is proposed in this article. The attack is as difficult as factoring the product of two large prime numbers. It does not need any one-way hash function. The integrity guarantee is given to the public parameters which can prevent a conspirator from falsely accusing any specific members. It can be easily expanded to the multi-secret sharing scheme. The quantity of communication is smaller than that in Chang-Hwang scheme.