Research And Design Of The Signature Schemes Based On Bilinear Pairings

With the fast development of the technique of computer network, all kinds of network services have soaked into many aspects of the people's life. On the one hand, they bring much convenience and benefits to people's life. On the other hand, they bring an unparalleled threat. Digital signature, which can provide authentication, integrity and non-repudiation is one of the key techniques of information security and plays an important role in E-ecommerce and E-govemance. As the deepening of digital signature research and the rapid development of E-ecommerce and E-governance, the standard signature, which is a simple simulation of handwritten signature, can not meet the practical need any more. Thus, making research on the digital signatures with additional properties becomes a main research direction in digital signatures.Bilinear pairings is a crucial tool for constructing the signatures in recent years. The bilinear Pairing-based signatures not only have the advantages of higher security, shorter key size and faster implementation, but also possess many benefits that can not be easily achieved by using other techniques. This dissertation is jointly supported by National Basic Research Program of China (973 Program) (2007CB310704), National Natural Science Foundation of China (No. 90718001), Programm of Introducing Talents of Discipline to Universities (No. B08004), Specialized Research Fund for the Doctoral Program of Higher Education (No. 20070013005). We focus on the research and design of the pairing-based signatures in following aspects: identity-based blind signature, proxy signature, universal designated verifier signature and identity-based verifiably encrypted signature. The main contributions of this dissertation are as follows:1. We do research on identity based blind signature scheme. A provably secure identity-based partially blind signature scheme is proposed. Assuming the intractability of the q-Strong Diffie-Hellman problem, our scheme is existentially unforgeable against adaptive chosen message and ID attacks in the random oracle model. Because of using less pairing computation, our scheme is highly efficient compared with existing schemes. Combining threshold signature with blind signature, we give an efficient identity-based threshold blind signature and prove that our scheme is correct, non-forgeable and robust. And then, Based on the proposed partially blind signature scheme, we give a new efficient restrictive partially blind signature and prove that the scheme is correct, non-forgeable, restrictiveness and partially blind. At last, Based on the presented ID-based restrictive partially blind signature, a new fair off-line electronic cash system is proposed. By embedding the common information irrelevent to user's identity, the complexity of management is declined and at the same time, the user's privacy is protected.2. We do research on proxy signature scheme. Huang et al. proposed an efficient threshold proxy signature with known signers (denoted as HC scheme). We show that the HC scheme is not secure against frame attack and public-key substitute attack and give a new efficient scheme which remedies the security flaws of the existing scheme. And then, the security of identity-based threshold proxy signature proposed by Xu et al. (denoted as XZF scheme) is analyzed. In XZF scheme, based on the proxy signature generated by proxy signers on a message on behalf of an original signer, an attacker can forge a valid threshold proxy signature on the same message which seemed generated by proxy signers on behalf of this attacker himself. To avoid this attack, a new identity-based threshold proxy signature is further proposed, which can resolve the security problem existing in XZF scheme and is more efficient than XZF scheme. At last, a new provably secure signature scheme in the standard model is proposed. The scheme is proved secure against existential forgery in adaptively chosen message attack in the standard model. Compared with existing schemes, the proposed scheme has a tight security reduction and needs less public parameters. It is very efficient in the stage of generating secret key, standard signing, proxy signing and generating delegation.3. We do research on universal designated verifier signature scheme. The delegatability of two universal designated verifier signature schemes presented respectively by Shailaja and Huang is analyzed and delegation attack to the schemes is put forward. Based on the ZSS short signature, an efficient universal designated verifier signature against delegation attack is proposed and the scheme is unforgeable, non-delegatable and non-transferable in the random oracle model. Because of avoiding inefficient MapToPoint function and using less pairing computation, our scheme is highly efficient compared with existing scheme.4. In the end, we do research on identity based verifiably encrypted signature scheme. ID-based verifiably encrypted signature is an extended signature type and plays an important role in constructing fair exchange. To our best knowledge, the security of the existing identity based verifiably encrypted signature schemes are based on the random oracle model. Based on the Paterson's ID-based signature and bilinear pairing, we propose the first identity based verifiably encrypted signature scheme whose security can be proven in the standard model and prove that our scheme is non-forgeable and opaque based on the difficulty of solving the CDH problem. In this scheme, by introducing a trusted third party, the fair exchange between users is ensured and the legitimate rights and interests of users are protected.