Title :
A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes
Author :
Iwamoto, Mitsugu ; Yamamoto, Hirosuke ; Koga, Hiroki
Author_Institution :
Grad. Sch. of Inf. Syst., Univ. of Electro-Commun., Chofu, Japan
fDate :
June 28 2009-July 3 2009
Abstract :
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.
Keywords :
block codes; block coding; cheating detection; cheating-detectable; coding theorem; decoding error probability; impersonation attack; threshold blockwise secret sharing scheme; Block codes; Cryptography; Decoding; Error correction codes; Error probability; Information security; Information systems; Mutual information; Random variables; Systems engineering and theory;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205941
