Lightweight Authenticated Encryption Mode with Enhancing Security Guarantees

Ping Zhang, Qian Yuan
{"title":"Lightweight Authenticated Encryption Mode with Enhancing Security Guarantees","authors":"Ping Zhang, Qian Yuan","doi":"10.1109/ICCCS52626.2021.9449205","DOIUrl":null,"url":null,"abstract":"Under the lightweight setting, the security requirements and the leaking security bits for devices or systems are stricter. This paper focuses on the security of permutation-based lightweight authenticated encryption (LAE) modes, presents a new syntax of LAE, and, on the basis of OPP. proposes an enhanced LAE mode called OPP-plus which supports beyond-birthday-bound (BBB) security and integrity security under the releasing unverified plaintext (INT-RUP). For achieving BBB security, OPP-plus is set up by two-round Even-Mansour ciphers with distinct keys. For ensuring INT-RUP security, the authentication part of OPP-plus utilizes an extra intermediated checksum technique to generate the authentication tag. Then, by using the hybrid argument, we prove that OPP-plus meets our stronger security requirements in the nonce-respecting scenario if the underlying permutation is an ideal random permutation. Finally, we discuss the properties of OPP-plus. OPP-plus is based on a pure-permutation, and supports adaptively block-size and smaller security losses. As OPP-plus does not perform the key expansion algorithm and its parts of combinatorial circuits can be replaced directly by lookup tables, the cost of keys' update is relatively small and the implementation efficiency is relatively high in practice.","PeriodicalId":376290,"journal":{"name":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCS52626.2021.9449205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Under the lightweight setting, the security requirements and the leaking security bits for devices or systems are stricter. This paper focuses on the security of permutation-based lightweight authenticated encryption (LAE) modes, presents a new syntax of LAE, and, on the basis of OPP. proposes an enhanced LAE mode called OPP-plus which supports beyond-birthday-bound (BBB) security and integrity security under the releasing unverified plaintext (INT-RUP). For achieving BBB security, OPP-plus is set up by two-round Even-Mansour ciphers with distinct keys. For ensuring INT-RUP security, the authentication part of OPP-plus utilizes an extra intermediated checksum technique to generate the authentication tag. Then, by using the hybrid argument, we prove that OPP-plus meets our stronger security requirements in the nonce-respecting scenario if the underlying permutation is an ideal random permutation. Finally, we discuss the properties of OPP-plus. OPP-plus is based on a pure-permutation, and supports adaptively block-size and smaller security losses. As OPP-plus does not perform the key expansion algorithm and its parts of combinatorial circuits can be replaced directly by lookup tables, the cost of keys' update is relatively small and the implementation efficiency is relatively high in practice.
增强安全保证的轻量级认证加密模式
在轻量级设置下,对设备或系统的安全要求和泄漏的安全位更严格。本文重点研究了基于置换的轻量级身份验证加密(LAE)模式的安全性,提出了一种新的LAE语法,并在opp的基础上提出了一种增强的LAE模式OPP-plus,该模式支持超越生日边界(BBB)安全和发布未经验证明文(INT-RUP)下的完整性安全。为了实现BBB安全性,OPP-plus由两轮具有不同密钥的Even-Mansour密码建立。为了确保INT-RUP的安全性,OPP-plus的身份验证部分利用额外的中间校验和技术来生成身份验证标记。然后,通过使用混合论证,我们证明了如果底层排列是理想随机排列,OPP-plus在不尊重场景下满足我们更强的安全性要求。最后,我们讨论了OPP-plus的性质。OPP-plus基于纯置换,支持自适应块大小和更小的安全损失。由于OPP-plus不执行键扩展算法,其组合电路部分可以直接由查找表代替,因此在实践中键更新的成本相对较小,实现效率相对较高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信