How to share a secret with cheaters
Journal of Cryptology
Size of shares and probability of cheating in threshold schemes
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A perfect threshold secret sharing scheme to identify cheaters
Designs, Codes and Cryptography
Communications of the ACM
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
Designs, Codes and Cryptography
Cheating Prevention in Secret Sharing
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Optimum Secret Sharing Scheme Secure against Cheating
SIAM Journal on Discrete Mathematics
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Almost optimum t-cheater identifiable secret sharing schemes
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
| Hi-index | 0.00 |
In this paper, we point out flaws in existing secret sharing schemes against cheating. Namely, we show that a scheme proposed by Ghodosi and Pieprzyk presented at ACISP 2000 and a one by Obana and Araki presented at Asiacrypt 2006 are both insecure against single cheater. We further show that the scheme by Obana et al. can be made secure by slight modification.