中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Authentication codes and bipartite graphs

文献类型:期刊论文

作者Feng, Rongquan1; Hu, Lei2; Kwak, Jin Ho3
刊名European journal of combinatorics
出版日期2008-08-01
卷号29期号:6页码:1473-1482
ISSN号0195-6698
DOI10.1016/j.ejc.2007.06.013
通讯作者Feng, rongquan(fengrq@math.pku.edu.cn)
英文摘要In this paper, a characterization of authentication codes in terms of bipartite graphs is given. by using such a characterization, two necessary and sufficient conditions for a minimal authentication code with perfect secrecy are derived. the probabilities of a successful impersonation and of a successful substitution attack are discussed. as a result, some (optimal) minimal authentication codes with perfect secrecy are constructed from association schemes, from finite groups or from known authentication codes no matter whether the known ones are with or without secrecy. (c) 2007 elsevier ltd. all rights reserved.
WOS关键词SCHEMES ; DESIGNS
WOS研究方向Mathematics
WOS类目Mathematics
语种英语
WOS记录号WOS:000257047200009
出版者ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD
URI标识http://www.irgrid.ac.cn/handle/1471x/2387758
专题中国科学院大学
通讯作者Feng, Rongquan
作者单位1.Peking Univ, LMAM, Sch Math Sci, Beijing 100871, Peoples R China
2.Chinese Acad Sci, Grad Sch, State Key Lab Informat Secur, Beijing 100039, Peoples R China
3.Pohang Univ Sci & Technol, Pohang 790784, South Korea
推荐引用方式
GB/T 7714
Feng, Rongquan,Hu, Lei,Kwak, Jin Ho. Authentication codes and bipartite graphs[J]. European journal of combinatorics,2008,29(6):1473-1482.
APA Feng, Rongquan,Hu, Lei,&Kwak, Jin Ho.(2008).Authentication codes and bipartite graphs.European journal of combinatorics,29(6),1473-1482.
MLA Feng, Rongquan,et al."Authentication codes and bipartite graphs".European journal of combinatorics 29.6(2008):1473-1482.

入库方式: iSwitch采集

来源:中国科学院大学

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。