量子安全部分并行 MAC QPCBC

IF 1.4 2区 数学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Shuping Mao, Tingting Guo, Peng Wang, Ruozhou Xu, Yuchao Chen, Lei Hu
{"title":"量子安全部分并行 MAC QPCBC","authors":"Shuping Mao, Tingting Guo, Peng Wang, Ruozhou Xu, Yuchao Chen, Lei Hu","doi":"10.1007/s10623-024-01506-7","DOIUrl":null,"url":null,"abstract":"<p>The quantum security of message authentication codes (MACs) has been gaining increasing attention in recent years, particularly with regard to proving the quantum security of classical MACs, which has emerged as a significant area of interest. In this work, we present two variants of classical MACs: QPMAC, a quantum-secure parallel version of PMAC, and QCBCMAC, a quantum-secure variant of CBCMAC and NMAC that supports variable-length input. We demonstrate that QPMAC is a parallel quantum-secure MAC, with an inverse relationship between its degree of parallelism and its level of quantum security. On the other hand, QCBCMAC provides quantum security for variable-length inputs. To achieve an optimal balance between parallelism and quantum security, we propose QPCBC, a hybrid construction that combines the strengths of QPMAC and QCBCMAC. We also provide an instantiation of QPCBC using tweakable block ciphers.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"21 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A quantum-secure partial parallel MAC QPCBC\",\"authors\":\"Shuping Mao, Tingting Guo, Peng Wang, Ruozhou Xu, Yuchao Chen, Lei Hu\",\"doi\":\"10.1007/s10623-024-01506-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The quantum security of message authentication codes (MACs) has been gaining increasing attention in recent years, particularly with regard to proving the quantum security of classical MACs, which has emerged as a significant area of interest. In this work, we present two variants of classical MACs: QPMAC, a quantum-secure parallel version of PMAC, and QCBCMAC, a quantum-secure variant of CBCMAC and NMAC that supports variable-length input. We demonstrate that QPMAC is a parallel quantum-secure MAC, with an inverse relationship between its degree of parallelism and its level of quantum security. On the other hand, QCBCMAC provides quantum security for variable-length inputs. To achieve an optimal balance between parallelism and quantum security, we propose QPCBC, a hybrid construction that combines the strengths of QPMAC and QCBCMAC. We also provide an instantiation of QPCBC using tweakable block ciphers.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"21 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-10-04\",\"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-01506-7\",\"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-01506-7","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

近年来,消息认证码(MAC)的量子安全性越来越受到关注,特别是在证明经典 MAC 的量子安全性方面,这已成为一个重要的兴趣领域。在这项工作中,我们提出了经典 MAC 的两种变体:QPMAC 是 PMAC 的量子安全并行版本,QCBCMAC 是 CBCMAC 和 NMAC 的量子安全变体,支持可变长度输入。我们证明 QPMAC 是一种并行量子安全 MAC,其并行程度与量子安全水平之间存在反比关系。另一方面,QCBCMAC 为可变长度输入提供量子安全。为了在并行性和量子安全性之间实现最佳平衡,我们提出了 QPCBC,一种结合了 QPMAC 和 QCBCMAC 优点的混合构造。我们还提供了使用可调整块密码的 QPCBC 实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A quantum-secure partial parallel MAC QPCBC

A quantum-secure partial parallel MAC QPCBC

The quantum security of message authentication codes (MACs) has been gaining increasing attention in recent years, particularly with regard to proving the quantum security of classical MACs, which has emerged as a significant area of interest. In this work, we present two variants of classical MACs: QPMAC, a quantum-secure parallel version of PMAC, and QCBCMAC, a quantum-secure variant of CBCMAC and NMAC that supports variable-length input. We demonstrate that QPMAC is a parallel quantum-secure MAC, with an inverse relationship between its degree of parallelism and its level of quantum security. On the other hand, QCBCMAC provides quantum security for variable-length inputs. To achieve an optimal balance between parallelism and quantum security, we propose QPCBC, a hybrid construction that combines the strengths of QPMAC and QCBCMAC. We also provide an instantiation of QPCBC using tweakable block ciphers.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
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学术官方微信