Font Size: a A A

Design And Analysis Of ID-based Signature Schemes

Posted on:2007-03-26Degree:DoctorType:Dissertation
Country:ChinaCandidate:C X GuFull Text:PDF
GTID:1118360212475802Subject:Cryptography
Abstract/Summary:PDF Full Text Request
ID-based cryptosystem simplifies the key management process which is a heavy burden in the traditional certificate-based cryptosystems. It has been, for a few years, the most active area of research and currently is of great interest to the cryptographic society. Evaluating the security is a very important and tricky business in the design of new ID-based schemes. Provable security based on complexity theory provides an efficient way for providing the convincing evidences of security. This dissertation investigates the design and. security analysis of ID-based schemes, including ID-based signatures, ID-based proxy signatures, ID-based proxy multi-signatures, and ID-based verifiably encrypted signatures. The contributions of this dissertation can be summarized as following:1. Researches on the security analysis of ID-based generic signature schemes. This dissertation proposes for the first time the notion of ID-based generic signature schemes and prove the Forking Lemma for it. The notion of ID-based generic signature schemes covers almost all existed ID-based, signature schemes from pairings. Hence this work leads to an efficient way for proving the security of ID-based schemes with extended Forking Lemma in the random oracle model.2. Researches on the design and analysis of ID-based proxy signature schemes. This dissertation presents for the first time the formal definitions for the ID-based signature scheme and its security notions. This work provides theoretical foundations for the design and security analysis of this kind of schemes. Then, this dissertation proposes a, new ID-based proxy signature scheme according to the Extract algorithm due to Sakai and Kasahara. The new scheme can be proved secure with the hardness assumption of the k-Bilinear Diffie-Hellman Inverse problem, in the random oracle model. The verification procedure involves only I pairing operation, so the new scheme is more efficient than previous works (need at least 2 pairing operations). What's more, we analyze the ID-based proxy signature scheme proposed by Zhang et al, which was not proven secure in the original work. We provide a security proof for the scheme in the random oracle model.3. Researches on the design and analysis of ID-based proxy multi-signature schemes. This dissertation presents formal definitions for the ID-based proxy mulii-signature scheme and its security notions. Then, we provide a new ID-based proxy multisignature scheme. The security can be reduced to the hardness assumption of the...
Keywords/Search Tags:ID-based cryptography, random oracle, provable security, signatures, proxy signatures, proxy multi-signatures, verifiably encrypted signature, hybrid verifiably encrypted signatures
PDF Full Text Request
Related items