{"title":"配备自适应小组测试检测功能的交互式汇总信息验证","authors":"Kazuhiko Minematsu, Shingo Sato, Junji Shikata","doi":"10.1007/s10623-024-01498-4","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we propose a formal security model and a construction methodology of interactive aggregate message authentication codes with detecting functionality (IAMDs). The IAMD is an interactive aggregate MAC protocol which can identify invalid messages with a small amount of tag-size. Several aggregate MAC schemes that can detect invalid messages have been proposed so far by using non-adaptive group testing in the prior work. In this paper, we utilize adaptive group testing to construct IAMD scheme, and we show that the resulting IAMD scheme can identify invalid messages with a small amount of tag-size compared to the previous schemes. To this end, we give the formalization of adaptive group testing and IAMD, and propose a generic construction starting from any aggregate MAC and any adaptive group testing method. In addition, we compare instantiations of our generic constructions, in terms of total tag-size and several properties. Furthermore, we show advantages of IAMD by implementing constructions of (non-)adaptive aggregate message authentication with detecting functionality and comparing these ones in terms of the data-size and running time of verification algorithms.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"12 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing\",\"authors\":\"Kazuhiko Minematsu, Shingo Sato, Junji Shikata\",\"doi\":\"10.1007/s10623-024-01498-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we propose a formal security model and a construction methodology of interactive aggregate message authentication codes with detecting functionality (IAMDs). The IAMD is an interactive aggregate MAC protocol which can identify invalid messages with a small amount of tag-size. Several aggregate MAC schemes that can detect invalid messages have been proposed so far by using non-adaptive group testing in the prior work. In this paper, we utilize adaptive group testing to construct IAMD scheme, and we show that the resulting IAMD scheme can identify invalid messages with a small amount of tag-size compared to the previous schemes. To this end, we give the formalization of adaptive group testing and IAMD, and propose a generic construction starting from any aggregate MAC and any adaptive group testing method. In addition, we compare instantiations of our generic constructions, in terms of total tag-size and several properties. Furthermore, we show advantages of IAMD by implementing constructions of (non-)adaptive aggregate message authentication with detecting functionality and comparing these ones in terms of the data-size and running time of verification algorithms.</p>\",\"PeriodicalId\":11130,\"journal\":{\"name\":\"Designs, Codes and Cryptography\",\"volume\":\"12 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-01498-4\",\"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-01498-4","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
本文提出了具有检测功能的交互式聚合消息验证码(IAMD)的正式安全模型和构建方法。IAMD 是一种交互式聚合 MAC 协议,只需少量标签大小就能识别无效信息。迄今为止,已有几种聚合 MAC 方案通过使用非适应性分组测试来检测无效信息。本文利用自适应分组测试构建了 IAMD 方案,并证明与之前的方案相比,IAMD 方案能以较小的标签大小识别无效信息。为此,我们给出了自适应分组测试和 IAMD 的形式化,并提出了一种从任意聚合 MAC 和任意自适应分组测试方法出发的通用构造。此外,我们还从总标签大小和几个属性方面比较了通用结构的实例。此外,我们还通过实现具有检测功能的(非)自适应聚合消息验证结构,并从数据大小和验证算法的运行时间方面对这些结构进行比较,从而展示了 IAMD 的优势。
Interactive aggregate message authentication equipped with detecting functionality from adaptive group testing
In this paper, we propose a formal security model and a construction methodology of interactive aggregate message authentication codes with detecting functionality (IAMDs). The IAMD is an interactive aggregate MAC protocol which can identify invalid messages with a small amount of tag-size. Several aggregate MAC schemes that can detect invalid messages have been proposed so far by using non-adaptive group testing in the prior work. In this paper, we utilize adaptive group testing to construct IAMD scheme, and we show that the resulting IAMD scheme can identify invalid messages with a small amount of tag-size compared to the previous schemes. To this end, we give the formalization of adaptive group testing and IAMD, and propose a generic construction starting from any aggregate MAC and any adaptive group testing method. In addition, we compare instantiations of our generic constructions, in terms of total tag-size and several properties. Furthermore, we show advantages of IAMD by implementing constructions of (non-)adaptive aggregate message authentication with detecting functionality and comparing these ones in terms of the data-size and running time of verification algorithms.
期刊介绍:
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.