ZLR:实现全面安全的快速在线验证加密方案

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS Designs, Codes and Cryptography Pub Date : 2024-05-30 DOI:10.1007/s10623-024-01434-6
Wonseok Choi, Seongha Hwang, Byeonghak Lee, Jooyoung Lee
{"title":"ZLR:实现全面安全的快速在线验证加密方案","authors":"Wonseok Choi, Seongha Hwang, Byeonghak Lee, Jooyoung Lee","doi":"10.1007/s10623-024-01434-6","DOIUrl":null,"url":null,"abstract":"<p>Online authenticated encryption has been considered of practical relevance in light-weight environments due to low latency and constant memory usage. In this paper, we propose a new tweakable block cipher-based online authenticated encryption scheme, dubbed <span>ZLR</span>, and its domain separation variant, dubbed <span>DS-ZLR</span>. <span>ZLR</span> and <span>DS-ZLR</span> follow the Encrypt-Mix-Encrypt paradigm. However, in contrast to existing schemes using the same paradigm such as <span>ELmE</span> and <span>CoLM</span>, <span>ZLR</span> and <span>DS-ZLR</span> enjoy <i>n</i>-bit security by using larger internal states with an efficient <span>ZHash</span>-like hashing algorithm. In this way, 2<i>n</i>-bit blocks are processed with only a single primitive call for hashing and two primitive calls for encryption and decryption, when they are based on an <i>n</i>-bit tweakable block cipher using <i>n</i>-bit (resp. 2<i>n</i>-bit) tweaks for <span>ZLR</span> (resp. <span>DS-ZLR</span>). Furthermore, they support pipelined computation as well as online nonce-misuse resistance. To the best of our knowledge, <span>ZLR</span> and <span>DS-ZLR</span> are the first pipelineable tweakable block cipher-based online authenticated encryption schemes of rate-2/3 that provide <i>n</i>-bit security with online nonce-misuse resistance.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":null,"pages":null},"PeriodicalIF":1.4000,"publicationDate":"2024-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ZLR: a fast online authenticated encryption scheme achieving full security\",\"authors\":\"Wonseok Choi, Seongha Hwang, Byeonghak Lee, Jooyoung Lee\",\"doi\":\"10.1007/s10623-024-01434-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Online authenticated encryption has been considered of practical relevance in light-weight environments due to low latency and constant memory usage. In this paper, we propose a new tweakable block cipher-based online authenticated encryption scheme, dubbed <span>ZLR</span>, and its domain separation variant, dubbed <span>DS-ZLR</span>. <span>ZLR</span> and <span>DS-ZLR</span> follow the Encrypt-Mix-Encrypt paradigm. However, in contrast to existing schemes using the same paradigm such as <span>ELmE</span> and <span>CoLM</span>, <span>ZLR</span> and <span>DS-ZLR</span> enjoy <i>n</i>-bit security by using larger internal states with an efficient <span>ZHash</span>-like hashing algorithm. In this way, 2<i>n</i>-bit blocks are processed with only a single primitive call for hashing and two primitive calls for encryption and decryption, when they are based on an <i>n</i>-bit tweakable block cipher using <i>n</i>-bit (resp. 2<i>n</i>-bit) tweaks for <span>ZLR</span> (resp. <span>DS-ZLR</span>). Furthermore, they support pipelined computation as well as online nonce-misuse resistance. To the best of our knowledge, <span>ZLR</span> and <span>DS-ZLR</span> are the first pipelineable tweakable block cipher-based online authenticated encryption schemes of rate-2/3 that provide <i>n</i>-bit security with online nonce-misuse resistance.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Designs, Codes and Cryptography\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10623-024-01434-6\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-024-01434-6","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

在线验证加密因其低延迟和内存使用量恒定而被认为在轻量级环境中具有实际意义。在本文中,我们提出了一种新的基于块密码的可调整在线验证加密方案(称为 ZLR)及其域分离变体(称为 DS-ZLR)。ZLR 和 DS-ZLR 遵循 "加密-混合-加密 "模式。然而,与使用相同范式的现有方案(如 ELmE 和 CoLM)相比,ZLR 和 DS-ZLR 通过使用更大的内部状态和类似 ZHash 的高效哈希算法,实现了 n 位安全性。这样,在处理 2n 位数据块时,只需对哈希算法调用一次基元调用,对 ZLR(或 DS-ZLR)调用两次基元调用即可完成加密和解密。此外,它们还支持流水线计算和在线非 Cce 抗滥用。据我们所知,ZLR 和 DS-ZLR 是第一个基于流水线可调整块密码的速率为 2/3 的在线验证加密算法,可提供 n 位安全性和在线抗非王牌误用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ZLR: a fast online authenticated encryption scheme achieving full security

Online authenticated encryption has been considered of practical relevance in light-weight environments due to low latency and constant memory usage. In this paper, we propose a new tweakable block cipher-based online authenticated encryption scheme, dubbed ZLR, and its domain separation variant, dubbed DS-ZLR. ZLR and DS-ZLR follow the Encrypt-Mix-Encrypt paradigm. However, in contrast to existing schemes using the same paradigm such as ELmE and CoLM, ZLR and DS-ZLR enjoy n-bit security by using larger internal states with an efficient ZHash-like hashing algorithm. In this way, 2n-bit blocks are processed with only a single primitive call for hashing and two primitive calls for encryption and decryption, when they are based on an n-bit tweakable block cipher using n-bit (resp. 2n-bit) tweaks for ZLR (resp. DS-ZLR). Furthermore, they support pipelined computation as well as online nonce-misuse resistance. To the best of our knowledge, ZLR and DS-ZLR are the first pipelineable tweakable block cipher-based online authenticated encryption schemes of rate-2/3 that provide n-bit security with online nonce-misuse resistance.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Designs, Codes and Cryptography
Designs, Codes and Cryptography 工程技术-计算机:理论方法
CiteScore
2.80
自引率
12.50%
发文量
157
审稿时长
16.5 months
期刊介绍: Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.
期刊最新文献
Asymptotically optimal aperiodic quasi-complementary sequence sets based on extended Boolean functions Arithmetization-oriented APN permutations Non-linear MRD codes from cones over exterior sets Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes Designs in finite classical polar spaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1