TY - GEN
T1 - Efficient identity-based signcryption in the standard model
AU - Li, Fagen
AU - Muhaya, Fahad Bin
AU - Zhang, Mingwu
AU - Takagi, Tsuyoshi
N1 - Copyright:
Copyright 2011 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then- encryption approach. Signcryption has been shown to be useful in many applications, such as electronic commerce, mobile communications and smart cards. Recently, three identity-based signcryption schemes in the standard model were proposed. However, the three schemes are broken soon. How to construct a secure identity-based signcryption scheme in the standard model is still an open problem. In this paper, we solve this problem and propose an efficient identity-based signcryption scheme in the standard model. We prove that our scheme has the indistinguishability against adaptive chosen ciphertext attacks under the modified decisional bilinear Diffie-Hellman assumption and the existential unforgeability against adaptive chosen messages attacks under the computational Diffie-Hellman assumption.
AB - Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then- encryption approach. Signcryption has been shown to be useful in many applications, such as electronic commerce, mobile communications and smart cards. Recently, three identity-based signcryption schemes in the standard model were proposed. However, the three schemes are broken soon. How to construct a secure identity-based signcryption scheme in the standard model is still an open problem. In this paper, we solve this problem and propose an efficient identity-based signcryption scheme in the standard model. We prove that our scheme has the indistinguishability against adaptive chosen ciphertext attacks under the modified decisional bilinear Diffie-Hellman assumption and the existential unforgeability against adaptive chosen messages attacks under the computational Diffie-Hellman assumption.
UR - http://www.scopus.com/inward/record.url?scp=80053168695&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80053168695&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-24316-5_10
DO - 10.1007/978-3-642-24316-5_10
M3 - Conference contribution
AN - SCOPUS:80053168695
SN - 9783642243158
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 120
EP - 137
BT - Provable Security - 5th International Conference, ProvSec 2011, Proceedings
T2 - 5th International Conference on Provable Security, ProvSec 2011
Y2 - 16 October 2011 through 18 October 2011
ER -