| 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 | |
| 2010 | |
| 会议名称 | 17th International Workshop on Fast Software Encryption |
| 页码 | 250-269 |
| 会议日期 | FEB 07-10, |
| 会议地点 | Seoul, SOUTH KOREA |
| 出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| 出版者 | FAST SOFTWARE ENCRYPTION |
| 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. |
| 摘要 | 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. |
| 关键词 | Message Authentication Code Block Cipher Mode Of Operation Provable Security |
| 主办者 | Korea Univ, CIST, Korea Inst Informat Security & Cryptol, Elect & Telcommun Res Inst, Ellipsis, Korea Univ, LG CNS, Natl Inst Math Sci |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/8706 |
| 专题 | 信息安全国家重点实验室 |
| 推荐引用方式 GB/T 7714 | Zhang Liting,Wu Wenling,Wang Peng,et al. constructing rate-1 macs from related-key unpredictable block ciphers: pgv model revisited[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:FAST SOFTWARE ENCRYPTION,2010:250-269. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| constructing rate-1 （287KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论