Information  Theoretic Lower Bounds for Authentication Codes with Arbiter

Wang Yongchuan; Yang Yixian

您当前的位置：

首页 >

文章列表页 >

Information Theoretic Lower Bounds for Authentication Codes with Arbiter

更新时间：2025-12-08

- Information Theoretic Lower Bounds for Authentication Codes with Arbiter
- Acta Electronica Sinica Issue 4, (1999)
- 作者机构：
  
  北京邮电大学信息安全中心
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN918.3
- Published：1999
- 稿件说明：
移动端阅览
[1]王永传,杨义先.有仲裁人认证码的信息论下界[J].电子学报,1999(04):91-94+98.

Wang Yongchuan, Yang Yixian. Information Theoretic Lower Bounds for Authentication Codes with Arbiter[J]. Acta Electronica Sinica, 1999, (4).
[1]王永传,杨义先.有仲裁人认证码的信息论下界[J].电子学报,1999(04):91-94+98. DOI：

Wang Yongchuan, Yang Yixian. Information Theoretic Lower Bounds for Authentication Codes with Arbiter[J]. Acta Electronica Sinica, 1999, (4). DOI：

摘要

在Ｓｉｍｍｏｎｓ给出的有仲裁人认证码中，主要研究了五种欺骗攻击．Ｊｏｈｎｓｏｎ对这些欺骗成功概率的信息论下界进行了研究．本文则给出了有仲裁人认证码中的敌方和收方的ｉ（０）阶欺骗攻击成功概率的信息论下界，完善了关于欺骗攻击成功概率的下界的研究．

Abstract

In the authentication codes with arbiter introduced by Simmons.five cheating attacks were mainly explored.The informationtheoretic lower bounds for the probability of successful deception for the five cheating attacks were obtained by Johnsson.In this paper

the information theoretic lower bounds for the probability of successful deception for spoofing attacks of order i by opponent and receiver are obtained.So the lower bounds for the probability of successful deception are perfected.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

MA Wen-ping

WANG Xin-mei

Related Institution

State key Lab.on ISN,Xidian University,Xian

⁰