| Title: | constructing rate-1 macs from related-key unpredictable block ciphers: pgv model revisited |
| Author: | Zhang Liting
; Wu Wenling
; Wang Peng
; Zhang Lei
; Wu Shuang
; Liang Bo
|
| Conference Name: | 17th International Workshop on Fast Software Encryption
|
| Conference Date: | FEB 07-10,
|
| Issued Date: | 2010
|
| Conference Place: | Seoul, SOUTH KOREA
|
| Keyword: | Message Authentication Code
; Block Cipher
; Mode of Operation
; Provable Security
|
| Publisher: | FAST SOFTWARE ENCRYPTION
|
| Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| ISSN: | 0302-9743
|
| ISBN: | 978-3-642-13857-7
|
| Department: | Zhang, Liting Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100190, Peoples R China.
|
| Sponsorship: | Korea Univ, CIST, Korea Inst Informat Security & Cryptol, Elect & Telcommun Res Inst, Ellipsis, Korea Univ, LG CNS, Natl Inst Math Sci
|
| English Abstract: | 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. |
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/8706
|
| Appears in Collections: | 信息安全国家重点实验室_会议论文
|
| 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,.
|
|
|
