Design and Analysis of ID-based Signature Schemes Archive - IT Research Paper

Design and Analysis of ID-based Signature Schemes

Title Design and Analysis of ID-based Signature Schemes
Abstract

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

Category Radio
Keywords hybrid verifiably encrypted signatures, ID based cryptography, provable security, proxy multi-signatures, proxy signatures, random oracle, signatures, verifiably encrypted signature,
FileType PDF
Pages 198
Price US$90.00
Buy Now
Download
Contact E-Mail:itpaper@hotmail.com
TEL:1-888-786-998A
FAQ How to get this paper's electronic documents?
1, Click the "Buy Now" button to complete the online payment
2, Download the paper's electronic document from the successful payment return page/Or the system will send this paper's electronic document to your E-Mail within 24 hours
Favorite ADD TO FAVORITE
Version zh-cn
© IT Research Paper