A Signature Scheme with Non-Repudiation

Based on the Schnorr signature scheme, a new signature scheme with non-repudiation is proposed. In this scheme, only the signer and the designated receiver can verify the signature signed by the signer, and if necessary, both the signer and the designated receiver can prove and show the validity of the signature signed by the signer. The proof of the validity of the signature is noninteractive and transferable. To verify and prove the validity of the signature, the signer and the nominated receiver needn＇t store extra information besides the signature. At the same time, neither the signer nor the designated receiver can deny a valid signature signed. Then, there is no repudiation in this new signature scheme. According to the security analysis of this scheme, it is found the proposed scheme is secure against existential forgery on adaptive chosen message attack.

CERTIFICATELESS SIGNATURE AND BLIND SIGNATURE

Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson.It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography(ID-PKC).Due to the advantages of the certificateless public key cryptography,a new efficient certificateless pairing-based signature scheme is presented,which has some advantages over previous constructions in computational cost.Based on this new signature scheme,a certificateless blind signature scheme is proposed.The security of our schemes is proven based on the hardness of computational Diffie-Hellman problem.

A New ID-Based Proxy Blind Signature Scheme

An identity-based proxy blind signature scheme from bilinear pairings isintroduced, which combines the advantages of proxy signature and blind signature. Furthermore, ourscheme can prevent the original signer from generating the proxy blind signature, thus the profitsof the proxy signer are guaranteed. We introduce bilinear pairings to minimize computationaloverhead and to improve the related performance of our scheme. In addition, the proxy blindsignature presented is non-repudiable and it fulfills perfectly the security requirements of a proxyblind signature.

CONSTRUCTION OF PROXY BLIND SIGNATURE SCHEME BASED ON MULTI-LINEAR TRANSFORM

A general method of constructing proxy blind signature is proposed based on multilinear transform. Based on this method, the four proxy blind signature schemes are correspondently generated with four different signature equations, and each of them has four forms of variations of signs. Hence there are sixteen signatures in all, and all of them are proxy stronglyblind signature schemes. Furthermore, the two degenerated situations of multi-linear transform are discussed. Their corresponding proxy blind signature schemes are shown, too. But some schemes come from one of these degenerate situations are proxy weakly-blind signature scheme.The security for proposed scheme is analyzed in details. The results indicate that these signature schemes have many good properties such as unforgeability, distinguish-ability of proxy signature,non-repudiation and extensive value of application etc.

Provably Secure Convertible Directed Partially Blind Signatures

Combining the concept of partially blind signature with the concept of directed signature, we introduce a new concept of convertible directed partially blind signature （CDPBS）, in which only the signer and the user can verify, confirm and disavow the validity of given signatures and convert given signatures into universally verifiable ones, to meet the need of signing personally or commercially sensitive messages. We give a formal definition of CDPBS and propose a concrete provably secure CDPBS scheme. The proposed scheme is efficient and secure, in which its unforgeability is the same as that of the Schnorr＇s signature scheme and its untransferability relies on the hardness of the decisional Diffie-Hellman problem. Furthermore, by letting the user＇s private key be a common constant, the proposed scheme can be used as a normal partially blind signature scheme.

Untraceable partially blind signature based on DLOG problem

This paper proposes a new untraceable Partially Blind Signature scheme which is a cross between the traditional signature scheme and the blind signature scheme. In this proposed scheme, the message M that the signer signed can be divided into two parts. The first part can be known to the signer (like that in the traditional signature scheme) while the other part cannot be known to the signer (like that in the blind signature scheme). After having signed M, the signer cannot determine if he has made the signature of M except through the part that he knows. We draw ideas from Brands' 'Restricted Blind Signature' to solve the Untraceable Partially Blind Signature problem. Our scheme is a probabilistic signature scheme and the security of our Untraceable Partially Blind Signature scheme relies on the difficulty of computing discrete logarithm.

可证明安全的SM2盲适配器签名方案

适配器签名是近年来出现的新密码学原语,其基本思想是将签名过程与秘密值的揭示联系起来,通过将预签名适配为正式签名,使最终的签名结果和常规签名一致。预签名与正式签名可提取出一个秘密值,因此具有原子性,在区块链中拥有良好的应用前景。但是适配器签名不具有匿名性,容易暴露交易参与者身份,在电子支付等隐私需求高的应用场景具有一定的局限性。为了解决这一问题,提出了新的盲适配器签名,系统模型和安全模型,在新系统模型的基础上提出了基于SM2签名算法的盲适配器签名方案,并基于SM2签名方案的不可伪造性和困难关系证明了该方案的安全性满足新提出的安全模型要求,即满足盲性、预签名可适配性、不可伪造性和证据可提取性。性能分析表明,在计算开销上,SM2盲适配器签名方案的总时间仅比SM2适配器签名方案增加了5.91 ms,与现有同类方案相比,该方案盲性更强且具有自主可控性,对于隐私要求高且需要采用国产密码算法的关键应用场景具有良好的应用价值。

CDBS:基于CRYSTALS-Dilithium算法的盲签名方案

为了应对传统盲签名方案在用户端、签名方和验证者交互过程中无法抵御量子计算攻击的这一难题,以NIST选定的后量子数字签名算法CRYSTALS-Dilithium为基础框架,设计了一种新型抗量子计算攻击的盲签名方案CDBS。整体方案采用Fiat-Shamir签名结构,包括密钥生成、盲化、签名、去盲和验证5个阶段,方案内部结合拒绝采样技术防止密钥泄露,使用NTT算法优化多项式计算以提高签名和验证效率。分析表明,所提方案安全性依赖于模误差学习(MLWE)问题和小整数解(SIS)问题,同时满足正确性、盲性和不可伪造性。与其他基于格的盲签名方案相比,所提方案具有较高的安全性,且签名生成过程更高效,占用开销更小。在相同样本参数设置下,所提方案整体开销仅为MBS方案的67.1%。经软件测试验证,实现一次完整的盲签名和验证过程平均仅需657.65μs。所提方案为CRYSTALS-Dilithium数字签名算法的拓展应用提供了参考。

基于椭圆曲线的数字签名与盲签名

椭圆曲线数字签名实际上是基于乘法群的离散对数的数字签名在椭圆曲线上的模拟。本文描述了由ＡＮＳＩ（１９９９）颁布的椭圆曲线数字签名算法（ＥＣＤＳＡ）标准，提出了三个新的基于椭圆曲线的数字签名方案和两个盲签名方案。

一种安全电子招标系统中专家抽取的方法

介绍了基于PKI架构的公开电子招标系统中专家管理信息系统的专家抽取方法。该方法通过使用加密技术解决专家抽取过程中的安全问题。采用盲签名协议保证抽取信息的机密性、真实性和不可否认性;通过随机算法保证抽取结果的随机化。在基于W eb的客户端,监督方在监控抽取过程中对抽取信息未知的情况下签名,确认抽取结果,抽取结果在公布时,获得带有监督方签名的抽取结果。

基于盲签名的在线选举方案

本文对离散对数、双离散对数及离散对数方根三种知识签名做些改进 ,提出对应的盲签名变形 .并应用这些盲知识签名 ,提出一种在线选举方案 。

对可撤销匿名性的盲代理签名方案的注记

对王晓明、符方伟所设计的一类可撤销匿名性的盲代理签名方案进行密码学分析,发现该方案效率不高,数据冗余量大.方案中的代理签名人具有滥用代理签名密钥进行代理签名的能力,并且能够对自己所生成的有效代理签名进行事后否认,即不满足代理签名权力的不可滥用性及代理签名的不可否认性两个基本性质.同时该方案并非作者所宣称的那样是不可伪造的,文章最后给出了一个对代理签名的伪造攻击,并针对该攻击提出了改进方法.

一种基于椭圆曲线密码体制的盲数字签名方案

椭圆曲线密码体制以其特有的优越性被广泛用于进行数据加密和构建数字签名方案。同样 ,它也可以用来构建盲数字签名方案。本文设计了一个新的基于椭圆曲线上的盲数字签名方案 ,这种方案的安全性是建立在目前还没有有效攻击方法的有限域上非超奇异椭圆曲线的椭圆曲线离散对数问题之上的 ,从理论上分析该方案是安全的 ,并具有一定的实用价值。

群体盲数字签名协议

在双离散对数和离散对数方根知识签名方案基础上加以改进 ,提出对应的盲签名协议 .并在 Camenisch的群签名协议基础上 ,结合前面的双离散对数及离散对数方根盲知识签名 ,提出一种群体盲签名方案 .该方案具有不可伪造性、盲签名性等特性 ,并且其计算、空间和通信复杂度都与安全参数

新的基于双线性对的多级强代理盲签名方案

提出了一个新的基于双线性对的基于身份的强代理盲签名方案,并构造了一个基于身份的多级强代理盲签名方案,实现了签名权利在许可范围内逐级向下代理的要求,并对方案的安全性和执行效率进行了分析。同时,方案也满足强代理签名以及强盲签名方案的各种性质,有效地防止了签名权利的滥用,因此,新方案具有实现简单而且安全性高的特点。

对一类基于离散对数的代理盲签名体制的伪造攻击

对Tan等人的代理盲签名方案,提出了一种伪造攻击,利用该伪造攻击,不诚实的原始签名人可以成功伪造代理签名密钥,从而能够假冒合法代理签名人生成验证有效的代理盲签名,威胁到代理签名人的合法权益.进而针对所提出的伪造攻击,对Tan等人的代理盲签名方案进行改进,克服了代理委托过程中造成代理签名密钥可伪造的因素,即-r的选择性构造,设计了一个新的代理盲签名方案.

基于ID的代理盲签名

在代理签名中,原始签名人能将其数字签名的权力委托给代理签名人;而在盲签名方案中,被签消息的内容对签名者是不可见的,签名被接受者得到后,签名者不能追踪签名。文章结合二者的优点,利用基于椭圆曲线上的Weil配对的双线性映射,在基于身份的数字签名的基础上,构造了一个基于ID的代理盲签名方案,并对其安全性作了简要分析。

基于改进椭圆曲线数字签名的盲签名

为了解决盲签名计算过程复杂的问题,在改进椭圆曲线数字签名方案的基础上,提出了一种基于椭圆曲线数字签名的盲签名方案。新方案通过改进签名式和验证式,同时引入三个随机参数,得到了基于椭圆曲线的强盲签名方案。分析表明,新方案加快了算法的运算速度,缩短了盲签名时间,具有更好的安全性。

可证安全的基于证书部分盲签名方案

为有效保护签名者的合法权益,防止盲签名的非法使用,解决传统公钥密码系统所存在的证书管理和使用代价高昂等问题,应用双线性映射,结合基于证书公钥密码体制和部分盲签名系统,提出一类基于证书的部分盲签名方案,包括基于证书部分盲签名的形式化定义及其安全性定义,并构造一个具体的基于证书的部分盲签名方案。在随机预言机模型下,基于计算DiffieHellman困难性假设,证明该方案的安全性,结果表明,该方案简化了基于传统公钥系统部分盲签名中证书的发布、存储与管理,并解决了基于身份部分盲签名系统中的密钥托管问题。

基于编码的盲签名方案

编码密码技术由于具有抵抗量子算法攻击的优点受到了广泛的关注。针对消息的匿名保护问题,提出了一种基于编码的盲签名方案。消息拥有者通过哈希技术和盲化因子将消息进行不可逆和盲化处理后发送给签名人,签名人利用CFS(Courtois-Finiasz-Sendrier)签名方案完成盲化签名并发回给消息拥有者,消息拥有者可通过去盲获得签名。分析表明,新的方案不仅具有一般盲签名的基本性质,而且继承了CFS签名方案的安全性高、签名长度短等优点,能够有效抵抗量子算法的攻击。