3kf9: enhancing 3gpp-mac beyond the birthday bound

ISCAS OpenIR

	3kf9: enhancing 3gpp-mac beyond the birthday bound
	Zhang Liting; Wu Wenling; Sui Han; Wang Peng
	2012
会议名称	18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	296-312
会议日期	December 2, 2012 - December 6, 2012
会议地点	Beijing, China
收录类别	EI
ISSN	0302-9743
ISBN	9783642349607
部门归属	(1) Institute of Software Chinese Academy of Sciences State Key Laboratory of Information Security China; (2) Institute of Information Engineering Chinese Academy of Sciences China
摘要	Among various cryptographic schemes, CBC-based MACs belong to the few ones most widely used in practice. Such MACs iterate a blockcipher EK in the so called Cipher-Block-Chaining way, i.e. Ci = E K(Mi ⊕Ci-1), offering high efficiency in practical applications. In the paper, we propose a new deterministic variant of CBC-based MACs that is provably secure beyond the birthday bound. The new MAC 3kf9 is obtained by combining f9 (3GPP-MAC) and EMAC sharing the same internal structure, and so it is almost as efficient as the original CBC MAC. 3kf9 offers O(l³q³/2²ⁿ + lq/2ⁿ) PRF-security when its underlying n-bit blockcipher is pseudorandom with three independent keys. This makes it more secure than traditional CBC-based MACs, especially when they are applied with lightweight blockciphers. Therefore, 3kf9 is expected to be a possible candidate MAC in resource-restricted environments. © International Association for Cryptologic Research 2012.; Among various cryptographic schemes, CBC-based MACs belong to the few ones most widely used in practice. Such MACs iterate a blockcipher EK in the so called Cipher-Block-Chaining way, i.e. Ci = E K(Mi ⊕Ci-1), offering high efficiency in practical applications. In the paper, we propose a new deterministic variant of CBC-based MACs that is provably secure beyond the birthday bound. The new MAC 3kf9 is obtained by combining f9 (3GPP-MAC) and EMAC sharing the same internal structure, and so it is almost as efficient as the original CBC MAC. 3kf9 offers O(l³q³/2²ⁿ + lq/2ⁿ) PRF-security when its underlying n-bit blockcipher is pseudorandom with three independent keys. This makes it more secure than traditional CBC-based MACs, especially when they are applied with lightweight blockciphers. Therefore, 3kf9 is expected to be a possible candidate MAC in resource-restricted environments. © International Association for Cryptologic Research 2012.
关键词	Security Of Data
主办者	International Association for Cryptologic Research (IACR); National Natural Science Foundation of China; Huawei Technologies Co. Ltd.; Intel Corporation
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15870
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zhang Liting,Wu Wenling,Sui Han,et al. 3kf9: enhancing 3gpp-mac beyond the birthday bound[C],2012:296-312.