论文标题
零知识证明周围的棘手的团体理论问题
Intractable Group-theoretic Problems Around Zero-knowledge Proofs
论文作者
论文摘要
虽然生产和积累的数据量继续以前所未有的速度促进，但数据的保护和隐藏增加了其作为需要更多行动的科学研究领域的突出性。在每个阶段保护对隐私敏感的数据至关重要。在静止，运行时以及在数据上执行计算时。零知识证明（ZKP）方案是实现此目标的加密工具。 ZKP允许一方可以安全地确保数据的真实性和精度，而不会在通信或计算过程中揭示对机密或隐私敏感的信息。零知识协议的功能基于棘手的问题。需要设计更安全有效的零知识证明。这种需求提出了确定适当的棘手问题以开发新型ZKP方案的必要性。在本文中，我们介绍了ZKP方案的简要概述，这些结构与群体理论上的棘手问题的联系，并注释了群体理论中棘手问题的列表，这些问题可用于设计新的ZKP方案。
While the amount of data produced and accumulated continues to advance at unprecedented rates, protection and concealment of data increase its prominence as a field of scientific study that requires more action. It is essential to protect privacy-sensitive data at every phase; at rest, at run, and while computations are executed on data. The zero-knowledge proof (ZKP) schemes are a cryptographic tool toward this aim. ZKP allows a party to securely ensure the data's authenticity and precision without revealing confidential or privacy-sensitive information during communication or computation. The power of zero-knowledge protocols is based on intractable problems. There is a requirement to design more secure and efficient zero-knowledge proofs. This demand raises the necessity of determining appropriate intractable problems to develop novel ZKP schemes. In this paper, we present a brief outline of ZKP schemes, the connection of these structures to group-theoretic intractable problems, and annotate a list of intractable problems in group theory that can be employed to devise new ZKP schemes.
