群作用表示及其在密码学中的应用

IF 1.2 3区 数学 Q1 MATHEMATICS
Giuseppe D'Alconzo, Antonio J. Di Scala
{"title":"群作用表示及其在密码学中的应用","authors":"Giuseppe D'Alconzo,&nbsp;Antonio J. Di Scala","doi":"10.1016/j.ffa.2024.102476","DOIUrl":null,"url":null,"abstract":"<div><p>Cryptographic group actions provide a flexible framework that allows the instantiation of several primitives, ranging from key exchange protocols to PRFs and digital signatures. The security of such constructions is based on the intractability of some computational problems. For example, given the group action <span><math><mo>(</mo><mi>G</mi><mo>,</mo><mi>X</mi><mo>,</mo><mo>⋆</mo><mo>)</mo></math></span>, the weak unpredictability assumption (Alamati et al. (2020) <span><span>[1]</span></span>) requires that, given random <span><math><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>'s in <em>X</em>, no probabilistic polynomial time algorithm can compute, on input <span><math><msub><mrow><mo>{</mo><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><mi>g</mi><mo>⋆</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>)</mo><mo>}</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>Q</mi></mrow></msub></math></span> and <em>y</em>, the set element <span><math><mi>g</mi><mo>⋆</mo><mi>y</mi></math></span>.</p><p>In this work, we study such assumptions, aided by the definition of <em>group action representations</em> and a new metric, the <em>q-linear dimension</em>, that estimates the “linearity” of a group action, or in other words, how much it is far from being linear. We show that under some hypotheses on the group action representation, and if the <em>q</em>-linear dimension is polynomial in the security parameter, then the weak unpredictability and other related assumptions cannot hold. This technique is applied to some actions from cryptography, like the ones arising from the equivalence of linear codes, as a result, we obtain the impossibility of using such actions for the instantiation of certain primitives.</p><p>As an additional result, some bounds on the <em>q</em>-linear dimension are given for classical groups, such as <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, <span><math><mi>GL</mi><mo>(</mo><msup><mrow><mi>F</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>)</mo></math></span> and the cyclic group <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> acting on itself.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"99 ","pages":"Article 102476"},"PeriodicalIF":1.2000,"publicationDate":"2024-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1071579724001151/pdfft?md5=da2ac4d07e20b23f31147c448a4a4dc4&pid=1-s2.0-S1071579724001151-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Representations of group actions and their applications in cryptography\",\"authors\":\"Giuseppe D'Alconzo,&nbsp;Antonio J. Di Scala\",\"doi\":\"10.1016/j.ffa.2024.102476\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Cryptographic group actions provide a flexible framework that allows the instantiation of several primitives, ranging from key exchange protocols to PRFs and digital signatures. The security of such constructions is based on the intractability of some computational problems. For example, given the group action <span><math><mo>(</mo><mi>G</mi><mo>,</mo><mi>X</mi><mo>,</mo><mo>⋆</mo><mo>)</mo></math></span>, the weak unpredictability assumption (Alamati et al. (2020) <span><span>[1]</span></span>) requires that, given random <span><math><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub></math></span>'s in <em>X</em>, no probabilistic polynomial time algorithm can compute, on input <span><math><msub><mrow><mo>{</mo><mo>(</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>,</mo><mi>g</mi><mo>⋆</mo><msub><mrow><mi>x</mi></mrow><mrow><mi>i</mi></mrow></msub><mo>)</mo><mo>}</mo></mrow><mrow><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>Q</mi></mrow></msub></math></span> and <em>y</em>, the set element <span><math><mi>g</mi><mo>⋆</mo><mi>y</mi></math></span>.</p><p>In this work, we study such assumptions, aided by the definition of <em>group action representations</em> and a new metric, the <em>q-linear dimension</em>, that estimates the “linearity” of a group action, or in other words, how much it is far from being linear. We show that under some hypotheses on the group action representation, and if the <em>q</em>-linear dimension is polynomial in the security parameter, then the weak unpredictability and other related assumptions cannot hold. This technique is applied to some actions from cryptography, like the ones arising from the equivalence of linear codes, as a result, we obtain the impossibility of using such actions for the instantiation of certain primitives.</p><p>As an additional result, some bounds on the <em>q</em>-linear dimension are given for classical groups, such as <span><math><msub><mrow><mi>S</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, <span><math><mi>GL</mi><mo>(</mo><msup><mrow><mi>F</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>)</mo></math></span> and the cyclic group <span><math><msub><mrow><mi>Z</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> acting on itself.</p></div>\",\"PeriodicalId\":50446,\"journal\":{\"name\":\"Finite Fields and Their Applications\",\"volume\":\"99 \",\"pages\":\"Article 102476\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S1071579724001151/pdfft?md5=da2ac4d07e20b23f31147c448a4a4dc4&pid=1-s2.0-S1071579724001151-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite Fields and Their Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1071579724001151\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579724001151","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

加密群组行为提供了一个灵活的框架,可以将从密钥交换协议到 PRF 和数字签名等多种基本原理实例化。这种结构的安全性基于某些计算问题的难解性。例如,给定群动作 (G,X,⋆),弱不可预测性假设(Alamati 等人 (2020) [1])要求,给定 X 中的随机 xi,任何概率多项式时间算法都无法在输入 {(xi,g⋆xi)}i=1,...Q 和 y 的情况下计算集合元素 g⋆y。在这项工作中,我们借助群作用表示的定义和一种新度量--q-线性维度--来研究这些假设,q-线性维度可以估算群作用的 "线性度",或者换句话说,它离线性有多远。我们证明,在群体行动表示的某些假设下,如果 q 线性维度是安全参数的多项式,那么弱不可预测性和其他相关假设就不成立。我们将这一技术应用于密码学中的一些作用,如线性编码等价性中产生的作用,结果发现不可能使用这些作用来实例化某些基元。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Representations of group actions and their applications in cryptography

Cryptographic group actions provide a flexible framework that allows the instantiation of several primitives, ranging from key exchange protocols to PRFs and digital signatures. The security of such constructions is based on the intractability of some computational problems. For example, given the group action (G,X,), the weak unpredictability assumption (Alamati et al. (2020) [1]) requires that, given random xi's in X, no probabilistic polynomial time algorithm can compute, on input {(xi,gxi)}i=1,,Q and y, the set element gy.

In this work, we study such assumptions, aided by the definition of group action representations and a new metric, the q-linear dimension, that estimates the “linearity” of a group action, or in other words, how much it is far from being linear. We show that under some hypotheses on the group action representation, and if the q-linear dimension is polynomial in the security parameter, then the weak unpredictability and other related assumptions cannot hold. This technique is applied to some actions from cryptography, like the ones arising from the equivalence of linear codes, as a result, we obtain the impossibility of using such actions for the instantiation of certain primitives.

As an additional result, some bounds on the q-linear dimension are given for classical groups, such as Sn, GL(Fn) and the cyclic group Zn acting on itself.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.00
自引率
20.00%
发文量
133
审稿时长
6-12 weeks
期刊介绍: Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering. For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods. The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.
×
引用
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学术官方微信