Abstract
Proxy signcryption means that the proxy signcrypter obtains the delegate authorization from the original signcrypter and then signcrypts the specified message on behalf of the original signcrypter. In this paper, we construct an identity-based proxy signcryption protocol (IBPSP) based on the universally composable (UC) framework. In the random oracle model, we prove that this protocol has the semantic security under the gap bilinear Diffie-Hellman and computational Diffie-Hellman assumptions. At the same time, an ideal functionality of the identity-based proxy signcryption protocol is defined in the UC security framework, and we also prove the equivalence between the universally composable identity-based proxy signcryption protocol and its IND-CCA2 and UF-CMA security. Analysis shows this IBPSP has both low computation complexity and semantic security together with UC security.
Highlights
Proxy signature [1] has the authenticity of signature but cannot guarantee the confidentiality of message
We construct a novel identity-based proxy signcryption protocol (IBPSP) with universal composability, whose semantic security is based on the intractability of the gap bilinear Diffie-Hellman and computational DiffieHellman (CDH) problems
In the random oracle model, we prove its indistinguishability against adaptive chosenciphertext attacks (IND-CCA2) and existential unforgeability against adaptive chosen-message attacks (UF-CMA)
Summary
Proxy signature [1] has the authenticity of signature but cannot guarantee the confidentiality of message. Wang et al [9] defined the ideal functionality of the identity-based signature protocol and simultaneously proved the equivalence between identitybased signature with UC security and classical identity-based signature with EUF-CMA security in an adaptive adversary model. Tian et al [11] devised secure multiparty computation with the universal composability and realized a fair and secure two-party computation protocol. In this case, when the boss is unable to sign personally, they can delegate their signing power to a proxy signer who can legitimately conduct transactions on their behalf It is an interesting research problem of how to construct a secure identity-based proxy signcryption protocol applying to a more complex network environment. We construct a novel identity-based proxy signcryption protocol (IBPSP) with universal composability, whose semantic security is based on the intractability of the gap bilinear Diffie-Hellman (gap BDH) and computational DiffieHellman (CDH) problems. We define the ideal functionality of IBPSP and illustrate the equivalence between the universally composable IBPSP and its IND-CCA2 and UF-CMA security
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
