Information-Theoretic Bounds for Authentication Frauds
Information-Theoretic Bounds for Authentication Frauds
复制标题
DOI：
10.1007/3-540-47555-9_41
复制
发表时间：
1992-05
期刊：
影响因子：
--
通讯作者：
Andrea Sgarro
中科院分区：
文献类型：
--
作者：
Andrea Sgarro
认证码的几个属性取决于一种数学结构，下面称为欺诈方案，它比最初给出的简单得多。基于这一事实，我们提出了一个强大的下界，它是一种模型，可以轻松地推导出身份验证编码中欺诈概率的整个信息理论界限。
Several properties of authentication codes depend on a mathematical structure, called below a fraud scheme, which is much simpler than the one originally given. Relying on this fact, we present a powerful lower bound, which is a sort of mould to painlessly derive a whole range of information-theoretic bounds to fraud probabilities in authentication coding.