在内自同构群上的离散对数问题困难假设下,提出了2个盲签名方案.这些方案均是基于非交换群的盲签名方案,并且均满足盲性和多一不可伪造性安全.对参数、效率的分析和比较结果表明,所构造的方案在运行时间、存储空间上均有效.
Two blind signature schemes based on the discrete logarithm problem over inner automorphism group are proposed. The schemes satisfy blinding and one-more unforgery. These constructions can be viewed as non-communtative variants of blind signatures. Parameters and performance related issues are also addressed in detail. By comparison, the blind signatures are efficient in the running time and storage space.