一种格上身份基高效环签名方案

AN IDENTITY-BASED EFFICIENT RING SIGNATURE ALGORITHM ON LATTICE

  • 摘要: 环签名具有匿名性与不可伪造性,可用来保护用户隐私,被广泛应用到电子匿名投票、匿名征信等场景。为了使环签名可抵抗量子攻击,该方案提出一种基于用户身份的格上环签名方案,节省了密钥对生成与管理的资源。在该方案中,使用了格的高效陷门生成算法以及陷门派生算法来生成用户的私钥,提高算法效率。通过拒绝抽样定理保证了私钥的安全。使用补零操作以及ISIS零知识证明保证了签名算法的安全性,且具有公钥较小的优势。通过分析可知,该方案具有全密钥暴露下的匿名性以及内部腐败下的不可伪造性。

     

    Abstract: Ring signature has anonymity and unforgeability, which is widely-used in anonymous electronic voting, anonymous credit investigation, and other scenarios to protect users’ privacy. In order to make ring signatures resistant to quantum attacks, this paper designs a lattice ring signature scheme based on user identity, which saves the resources of key pair generation and management. This paper used a simple trapdoor generation algorithm and trapdoor derivation algorithm to generate the user’s private key improving the algorithm’s efficiency. The security of the private key was guaranteed by the rejection sampling theorem. The security of the signature was guaranteed by using a simple zero filling operation and ISIS zero-knowledge proof, and this scheme had the advantage of a small public key. The analysis shows that this scheme has anonymity under full key exposure and unforgeability under internal corruption, which can resist the strongest attack.

     

/

返回文章
返回