On a Fallacious Bound for Authentication Codes
暂无分享,去创建一个
Abstract. We show that the lower bound on substitution success probability PS provided by Theorem 3.8 in De Soete's paper [4], which appeared earlier in this journal, is not correct by exhibiting a counterexample. We identify the flaw in the ``proof" of this theorem and we prove a valid lower bound on PS .
[1] Satoshi Obana,et al. t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes , 1995, CRYPTO.
[2] Alfredo De Santis,et al. Lower Bounds for Robust Secret Sharing Schemes , 1997, Inf. Process. Lett..