中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 软件研究所
  3. 软件所图书馆
  4. 会议论文
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
会议日期December 2, 2012 - December 6, 2012
会议地点Beijing, China
关键词Security of data
页码296-312
中文摘要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(l3q3/22n + lq/2n) 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(l3q3/22n + lq/2n) 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.
收录类别EI
会议主办者International Association for Cryptologic Research (IACR); National Natural Science Foundation of China; Huawei Technologies Co. Ltd.; Intel Corporation
会议录Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
语种英语
ISSN号0302-9743
ISBN号9783642349607
源URL[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]. 见:18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012. Beijing, China. December 2, 2012 - December 6, 2012.

入库方式： OAI收割

来源：软件研究所

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

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