Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
How to share a secret with cheaters
Journal of Cryptology
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Society and Group Oriented Cryptography: A New Concept
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Construction of nonlinear boolean functions with important cryptographic properties
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Cryptographically resilient functions
IEEE Transactions on Information Theory
Constructions of Cheating Immune Secret Sharing
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Verifiable distributed oblivious transfer and mobile agent security
Mobile Networks and Applications
Properties and constraints of cheating-immune secret sharing schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Properties and constraints of cheating-immune secret sharing schemes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Dynamic threshold and cheater resistance for shamir secret sharing scheme
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
Cheating immune (2, n)-threshold visual secret sharing
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
We consider secret sharing with binary shares. This model allows us to use the well developed theory of cryptographically strong boolean functions. We prove that for given secret sharing, the average cheating probability over all cheating and original vectors, i.e., 驴 = 1/n 驴 2-n驴c=1n驴驴驴Vn 驴c,驴 satisfies 驴 驴= 1/2, and the equality holds 驴 驴c,驴 satisfies 驴c,驴 = 1/2 for every cheating vector 驴c and every original vector 驴. In this case the secret sharing is said to be cheating immune. We further establish a relationship between cheating-immune secret sharing and cryptographic criteria of boolean functions. This enables us to construct cheating-immune secret sharing.