Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
Principles and practice of information theory
Principles and practice of information theory
How to share a secret with cheaters
Journal of Cryptology
Information Processing Letters
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
Optimum Secret Sharing Scheme Secure against Cheating
SIAM Journal on Discrete Mathematics
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
Hi-index | 0.00 |
It is known that a secret sharing scheme (SSS) with perfect cheating detection cannot be realized because such a SSS requires infinite share rates. However, this impossibility comes from the fact that block coding is not used and any decoding error is not allowed in the SSS. Hence, in this paper, we consider a SSS constructed by block coding with an arbitrarily small decoding error probability. It is shown that the perfect cheating detection with finite rates is possible for the 2-out-of-2 SSS in a certain asymptotic sense. Furthermore, the supremum of the achievable exponent in the maximum success probability of impersonation attack turns out to be the mutual information between the two shares.