中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 信息安全国家重点实验室  > 会议论文
题名:
constructing rate-1 macs from related-key unpredictable block ciphers: pgv model revisited
作者: Zhang Liting ; Wu Wenling ; Wang Peng ; Zhang Lei ; Wu Shuang ; Liang Bo
会议名称: 17th International Workshop on Fast Software Encryption
会议日期: FEB 07-10,
出版日期: 2010
会议地点: Seoul, SOUTH KOREA
关键词: Message Authentication Code ; Block Cipher ; Mode of Operation ; Provable Security
出版者: FAST SOFTWARE ENCRYPTION
出版地: HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN: 0302-9743
ISBN: 978-3-642-13857-7
部门归属: Zhang, Liting Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100190, Peoples R China.
主办者: Korea Univ, CIST, Korea Inst Informat Security & Cryptol, Elect & Telcommun Res Inst, Ellipsis, Korea Univ, LG CNS, Natl Inst Math Sci
英文摘要: Almost all current block-cipher-based MACs reduce their security to the pseudorandomness of their underlying block ciphers, except for a few of them to the unpredictability, a strictly weaker security notion than pseudorandomness. However, the latter MACs offer relatively low efficiency. In this paper, we investigate the feasibility of constructing rate-1 MACs from related-key unpredictable block ciphers. First, we show all the existing rate-1 MACs are insecure when instantiated with a special kind of related-key unpredictable block cipher. The attacks on them inspire us to propose an assumption that all the chaining values are available to adversaries for theoretically analyzing such MACs. Under this assumption, we study the security of 64 rate-1 MACs in keyed PGV model, and find that 1) 15 MACs are meaningless; 2) 25 MACs are vulnerable to three kinds of attacks respectively and 3) 24 MACs are provably secure when their underlying block ciphers are related-key unpredictable. Furthermore, we refine these 24 provably secure rate-1 MACs in Compact PGV model by removing a useless parameter away, and find that the resulting 6 provably secure MACs are in fact equivalent to each other. In the aspect of efficiency, however, the low rate of these secure MACs does not necessarily mean they can run faster than none rate-1 one MACs, due to their large number of key schedules.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8706
Appears in Collections:信息安全国家重点实验室_会议论文

Files in This Item:
File Name/ File Size Content Type Version Access License
constructing rate-1 macs from related-key unpredictable block ciphers.pdf(287KB)----限制开放-- 联系获取全文

Recommended Citation:
Zhang Liting,Wu Wenling,Wang Peng,et al. constructing rate-1 macs from related-key unpredictable block ciphers: pgv model revisited[C]. 见:17th International Workshop on Fast Software Encryption. Seoul, SOUTH KOREA. FEB 07-10,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zhang Liting]'s Articles
[Wu Wenling]'s Articles
[Wang Peng]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zhang Liting]‘s Articles
[Wu Wenling]‘s Articles
[Wang Peng]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace