基于辫群的不可否认签名方案
Undeniable Signature Schemes Using Braid Groups
摘要：
Artin的辫子群最近被认为是公钥密码学的一个新的来源。本文利用辫子群上的共轭问题和分解问题提出了第一个不可否认签名方案。
英文摘要：
Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first undeniable signature schemes using the conjugacy problem and the decomposition problem in the braid groups which are believed to be hard problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
