Abstract: A new efficient normative signature scheme, based on discrete logarithm assumption and factoring assumption is proposed. A zero knowledge proof protocol between the nominee and a third party to verify the signature is also constructed. This signature can be transformed into an undeniable and fail-stop signature if necessary. The efficiency of different nominative signature schemes is also compared

Key words: Scheme; Nominative signature; Fail-stop signature; Verification

摘要： 提出了一种基于离散对数假设与因子分解假设的有效的记名签名方案，构造了一个被签名人与第三方之间的零知识证明协议。在需要时，该记名签名方案可转化成不可抵赖签名、指定的确认人签名或者转换为失败终止签名。还比较了该方案与著名的记名签名的效率。

关键词: 方案；记名签名；失败终止签名；验证