arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.13810cs.CCcs.CR
收藏

关于密码群作用问题的困难性的一个注记

A Note on the Hardness of Problems from Cryptographic Group Actions

Giuseppe D'Alconzo

摘要:

给定一个密码学群作用,我们证明了群作用逆问题(GAIP)和其他相关问题不可能是NP-难的,除非多项式层次崩溃。我们通过随机自约简和交互式证明的设计来证明这一点。由于密码学群行为是许多安全协议的基石,这个结果既可以作为一些密码学假设的最坏情况复杂度的上限,也可以作为最坏情况和平均情况下的硬度一致的证明。我们还指出了与图同构和其他相关的NP中间问题的联系。

英文摘要:

Given a cryptographic group action, we show that the Group Action Inverse Problem (GAIP) and other related problems cannot be NP-hard unless the Polynomial Hierarchy collapses. We show this via random self-reductions and the design of interactive proofs. Since cryptographic group actions are the building block of many security protocols, this result serves both as an upper bound on the worst-case complexity of some cryptographic assumptions and as proof that the hardness in the worst and in the average case coincide. We also point out the link with Graph Isomorphism and other related NP intermediate problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑