Font Size: a A A

Researches On Digital Signature Scheme Based On Bilinear Map

Posted on:2012-02-25Degree:MasterType:Thesis
Country:ChinaCandidate:S D LiuFull Text:PDF
GTID:2218330368488518Subject:Basic mathematics
Abstract/Summary:PDF Full Text Request
In the open internet transmission environment, digital signature as one key technology of information security, plays an important role in data integrity verification, identity authentication and refuge prevention, and is widely used in electronic cash system, e-governments affairs, online contract signing and internet software licensing. At present, researches on digital signature system has becomes an important research topic in cryptology.Since the first appearance of digital signature scheme, many researches have been made, especially, applying bilinear mapping to digital signature, and thus lay a foundation for the rapid development and application of digital signature. For instance, proxy signature for delegation, group signature for secret sharing, (proxy) verifiably encryption signature for data fair exchange, designated verifier signature for electronic commerce and blind signature for electronic voting. Those are foundations for rapid development and application of signature.In this paper, by applying bilinear pairings, we make some beneficial trail and exploration on three kinds of digital signature which have been widely used in application under achievements made by predecessors, and make out beneficial results. The main contents of this paper spread as follows:1 By combining verifiably encrypted signature scheme and proxy signature scheme, a Certificate-based proxy verifiably encrypted signature scheme and an ID-Based proxy verifiably encrypted signature scheme are proposed. Then the correctness of two scheme are proved and their security are analyzed.2 Based on researches on designated verifier proxy signature schemes, a certificate-based strong designated verifier proxy signature scheme is constructed, which is not only provably secure against three types of probably forgeable adversaries in random oracle model under the hardness assumption of the computational Diffie-Hellman problem, but also secure against the forgery attacks which was picked out by Lee et al. on Kang et al.'s strong designated verifier signature.3 An efficient randomized blind signature is proposed. Firstly, the concept and construction of this scheme is introduced and then a special scheme is given and the correctness and the security of this scheme is proved and analyzed.
Keywords/Search Tags:Information security, Digital signature, Electronic commerce, Bilinear pairing, CDH problem, Blind signature
PDF Full Text Request
Related items