Proceedings of CRYPTO 84 on Advances in cryptology
How to share a secret with cheaters
Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An explication of secret sharing schemes
Designs, Codes and Cryptography
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
Cheating Immune Secret Sharing
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Constructions of Cheating Immune Secret Sharing
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Cheating Prevention in Secret Sharing over GF(pt)
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Cheating in Visual Cryptography
Designs, Codes and Cryptography
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Properties and constraints of cheating-immune secret sharing schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Sharing a verifiable secret image using two shadows
Pattern Recognition
Self-verifying visual secret sharing using error diffusion and interpolation techniques
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
A verifiable secret sharing scheme based on AMBTC
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
A (2, 2) secret sharing scheme based on hamming code and AMBTC
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
On the equivalence of two definitions of visual cryptography scheme
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
| Hi-index | 0.00 |
Cheating in secret sharing has been considered in several papers. Recently cheating in visual cryptography has been considered in [10], where (2,n)-threshold visual cryptography schemes are provided. In this paper we provide new (2,n)-threshold visual cryptography schemes. Our model is different from the one considered in [10]; in particular we aim at constructing cheating immune schemes without the use of extra information, like additional shares or images as done in [10]. We have provided a formal definition of cheating which requires that a group of cheaters be able to deterministically force a honest participant to reconstruct a wrong secret. The (2,n)-threshold schemes that we provide do not allow such cheating, regardless of the number of cheaters.