Robust Threshold Guillou-Quisquater Signature Scheme

The deficiencies of the first threshold Guilbu-Quisquater signature schemepresented by Li-San Liu, Cheng-Kang Chu and Wen-Guey Tzeng arc analysiscd at first, and then a newthreshold Guillou-Quisquater signature scheme is presented. The new scheme isunforgeable and robustagainst any adaptive adversary if the base Guillou-Quisquater signature scheme is unforgeable underthe chosen message attack and computing the discrete logarithm modulo a prime is hard This schemecan also achieve optimal resilience. However, the new scheme does not need the assumption that N isthe product of two safe primes. The basie signature scheme underlying the new scheme is exactlyGuillou-Quisqualtr signature scheme, and the additional strong computation assumption introduced bythe first threshold Guillou-Quisquater scheme is weaken.

Secure mediated certificateless signature scheme

Ju et al. proposed a certificateless signature scheme with instantaneous revocation by introducing security mediator （SEM） mechanism. This article presents a detailed cryptoanalysis of this scheme and shows that, in their proposed scheme, once a valid signature has been produced, the signer can recover his private key information and the instantaneous revocation property will be damaged. Furthermore, an improved mediated signature scheme, which can eliminate these disadvantages, is proposed, and security proof of the improved scheme under elliptic curve factorization problem （ECFP） assumption and bilinear computational diffie-hellman problem （BCDH） assumption is also proposed.

Improved lattice-based ring signature schemes from basis delegation

Ring signature enables the members to sign anonymously without a manager, it has many online applications, such as e-voting, e-money, whistle blowing etc. As a promising post-quantum candidate, lattice-based cryptography attracts much attention recently. Several efficient lattice-based ring signatures have been naturally constructed from lattice basis delegation, but all of them have large verification key sizes. Our observation finds that a new concept called the split- small integer solution （SIS） problem introduced by Nguyen et al. at PKC＇I 5 is excellent in reducing the public key sizes of lattice-based ring signature schemes from basis delegation. In this research, we first define an extended concept called the extended split-SIS problem, and then prove that the hardness of the extended problem is as hard as the approximating shortest independent vectors problem （SIVP） problem within certain polynomial factor. Moreover, we present an improved ring signature and prove that it is anonymous and unforgeable against the insider corruption. Finally, we give two other improved existing ring signature schemes from lattices. In the end, we show the comparison with the original scheme in terms of the verification key sizes. Our research data illustrate that the public key sizes of the proposed schemes are reduced significantly.

Stateless Transitive Signature Schemes

A new practical method is introduced to transform the stateful transitive signature scheme to stateless one with-out the loss of security.According to the approach,two concrete stateless transitive signature schemes based on Factoringand RSA are presented respectively.Under the assumption of the hardness of factoring and one-more-RSA-inversion prob-lem,both two schemes are secure under the adaptive chosen-message attacks in random oracle model.

Efficient ID-based proxy multi-signature scheme secure in random oracle

Proxy signature schemes enable an entity to del- egate its signing rights to any other party, called proxy signer. As a variant of proxy signature primitive, proxy multi- signature allows a group of original signers to delegate their signing capabilities to a single proxy signer in such a way that the proxy signer can sign a message on behalf of the group of original signers. We propose a concrete ID-based proxy multi-signature scheme from bilinear pairings. The proposed scheme is existential unforgeable against adaptively chosen message and given ID-attack in random oracle model under the computational Diltie-Hellman （CDH） assumption. The fascinating property of new scheme is that the size of a proxy multi-signature is independent of the number of original sign- ers. Furthermore the proposed scheme is simple and com- putationally more efficient than other ID-based proxy multi- signature schemes.

An Efficient Threshold Blind Signature from Weil Pairing

Threshold blind signature is playing an important role in cryptography as well as in practical applications such as e-cash and e-voting systems, etc. In this paper, we present an efficient and practical threshold bind signature from Weil pairing on super-singular elliptic curves or hyper-elliptic curves over finite field and prove that our scheme is provably secure in the random oracle model.

Certificateless network coding proxy signatures from lattice

Network coding can improve the information transmission efficiency and reduces the network resource consumption,so it is a very good platform for information transmission.Certificateless proxy signatures are widely applied in information security fields.However,certificateless proxy signatures based on classical number theory are not suitable for the network coding environment and cannot resist the quantum computing attacks.In view of this,we construct certificateless network coding proxy signatures from lattice(LCL-NCPS).LCL-NCPS is new multi-source signature scheme which has the characteristics of anti-quantum,antipollution and anti-forgery.In LCL-NCPS,each source node user can output a message vector to intermediate node and sink node,and the message vectors from different source nodes will be linearly combined to achieve the aim of improving the network transmission rate and network robustness.In terms of efficiency analysis of space dimension,LCL-NCPS can obtain the lower computation complexity by reducing the dimension of proxy key.In terms of efficiency analysis of time dimension,LCL-NCPS has higher computation efficiency in signature and verification.