两种基于离散对数的多重群签名方案

Two Digital Group-Multisignature Schemes Based on Discrete Logarithms

基于SCR算法的身份鉴别和签名,大部分计算可在预处理阶段完成,效率较高,安全性在于计算离散对数难度。基于此算法和离散对数相关理论,设计了两种多重群签名方案,具有较强的实用性。最后分析了这两种方案的安全性和性能。

For most part of the calculation can be handled at preprocessing phase, identification and signature schemes based on SCR algorithm have high efficiency, it’s security is based on the difficulty of the discrete logarithms problem. According to discrete logarithms theory, presenting two group-multisignature schemes. In the end, analysis the two schemes’ security and efficiency.