A lower bound on authentication after having observed a sequence of messages
A lower bound on authentication after having observed a sequence of messages
复制标题
DOI：
10.1007/bf00198462
复制
发表时间：
1993-03
影响因子：
3
通讯作者：
Ute Rosenbaum
中科院分区：
文献类型：
--
作者：
Ute Rosenbaum
在本文中，我们研究了认证系统，并考虑了以下场景：每个编码规则用于传输一系列消息。我们证明了在不知道所使用的编码规则的情况下，欺骗者观察到图像信息成功生成真实消息的概率的下界。当消息序列已知时，此界限基于编码规则的条件熵。研究了满足边界的认证系统，并将其与Massey[8]引入的防欺骗系统进行了比较。如果对手可以选择在尝试作弊前观察到多少条信息，我们也给出了成功概率的界限。
In this paper we study authentication systems and consider the following scenario: Each encoding rule is used for the transmission of a sequence ofimessages. We prove a lower bound on the probability that a spoofer observingimessages succeeds in generating an authentic message without knowing the encoding rule used. This bound is based on the conditional entropy of the encoding rules when a sequence of messages is known. Authentication systems which meet the bound are investigated and compared with systems that arel-fold secure against spoofing introduced by Massey [8]. We also give a bound for the probability of success if the opponent can choose how many messages he observes before trying to cheat.