...
首页> 外文期刊>IEEE Transactions on Information Theory >Authentication theory and hypothesis testing
【24h】

Authentication theory and hypothesis testing

机译:认证理论和假设检验

获取原文
获取原文并翻译 | 示例
           

摘要

By interpreting message authentication as a hypothesis testing problem, this paper provides a generalized treatment of information-theoretic lower bounds on an opponent's probability of cheating in one-way message authentication. We consider the authentication of an arbitrary sequence of messages, using the same secret key shared between sender and receiver. The adversary tries to deceive the receiver by forging one of the messages in the sequence. The classical two types of cheating are considered, impersonation and substitution attacks, and lower bounds on the cheating probability for any authentication system are derived for three types of goals the adversary might wish to achieve. These goals are: (1) that the fraudulent message should be accepted by the receiver, or, in addition, (2) that the adversary wishes to know or (3) wants to even choose the value of the plaintext message obtained by the legitimate receiver after decoding with the secret key.
机译:通过将消息身份验证解释为假设检验问题,本文提供了对信息理论下限的广义处理,该理论下限是对手在单向消息身份验证中作弊的概率。我们考虑使用发送方和接收方之间共享的相同密钥对任意消息序列进行身份验证。对手试图通过伪造序列中的消息之一来欺骗接收者。考虑了经典的两种作弊方式,即冒名顶替和替代攻击,并且针对对手可能希望实现的三种目标得出任何身份验证系统的作弊概率的下限。这些目标是:(1)欺骗性消息应被接收者接受,或者(2)对手希望知道的消息,或者(3)甚至选择合法用户获得的明文消息的值用密钥解密后的接收者。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号