QQ客服 官方微博 反馈留言

	Authentication codes and bipartite graphs
	Feng, Rongquan ; Hu, Lei ; Kwak, Jin Ho
	2008
关键词	SCHEMES DESIGNS
英文摘要	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.; Mathematics; SCI(E); 3; ARTICLE; 6; 1473-1482; 29
语种	英语
出处	SCI
出版者	european journal of combinatorics
内容类型	其他
源URL	[http://hdl.handle.net/20.500.11897/158191]
专题	数学科学学院
推荐引用方式 GB/T 7714	Feng, Rongquan,Hu, Lei,Kwak, Jin Ho. Authentication codes and bipartite graphs. 2008-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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