Font Size: a A A

Electronic Election Applied Research, Identity-based Blind Signature System

Posted on:2012-11-19Degree:MasterType:Thesis
Country:ChinaCandidate:P JinFull Text:PDF
GTID:2218330368497686Subject:Software engineering
Abstract/Summary:PDF Full Text Request
With the rapid development of the technique in network, all kinds of net services have soaked into all aspects of people's life. While bringing great convenience to our life, network technology and network service also bring unprecedented threat to information security. As a main way to protect information confidentiality, integrity and availability, cryptography has paid more and more attention.In 1985, Miller and Koblitz proposed ECC (Elliptic Curve Cryptography) independently. Due to its shorter key size, higher security, less computation, faster process speed, less memory space and lower bandwidth, it has received great international concern and also brings strong challenges to the traditional Public-Key Cryptosystems, such as RSA, ElGamal et al. Moreover, it has been adopted by wireless system and device with limited storages like smart card. Meanwhile, the Tate Pairing and Weil Pairing on ECC can be used to build the Identity-Based Cryptosystems (IBC). It can utilize user's identity (such as the user's name or e-mail address etc.) as public key in the cryptosystem, so that it reduces the reliance on public key certificates in the traditional Cryptosystems, which is especially suitable for PKI, Ad-hoc Network and such fields. At present, research on ECC is mainly on the following aspects: First, how to make faster and safer realization of scalar multiplication and the computation of Pairing in practice, especially in the side channel attack; Second, how to use Pairing to construct the faster and safer IBC systems which meet specific needs.Based on the above hot topics, this paper carries out the research in the following aspects:1. Based on the ideas of Ebeid's binary tree and Miller algorithm, a new computation of Pairing method for characteristic two was proposed, which use the optimal BSD randomized generated algorithm. Furthermore, based on Blake, Murty and Xu's algorithm, we optimized the Miller's algorithm of the characteristic three which used the concept of algebraic geometry (such as norm, conjugated straight line etc.) and the thought of reduction. Theoretical analysis and practical verification shows that its efficiency has been improved apparently, compared with existing algorithm. 2. Based on above new algorithms, we proposed a new efficient ID-base proxy Blind signature. It has satisfied the actual need of the E-commerce and E-government. Furthermore it overcomes many problems such as the high computational complexity to key generation, and also provides efficiency analysis and security proof.3. Focused on analyzing Asadpour election protocol flaws and shortcomings, and the special needs of electronic commerce, design a secure Electronic voting protocol, which the bilinear pairings based on the use of a special identity-based blind signature.
Keywords/Search Tags:Elliptic Curve Cryptography (ECC), Bilinear Pairing, Blind signature, Electronic voting
PDF Full Text Request
Related items