Abstract

The heterogeneous signcryption can not only realize the confidentiality and un-forgeability of the information transmission between different public key cryptography environments, but also reduce the communication cost. The proposed scheme uses bilin-ear pairings between certificateless cryptography and identity-based cryptography to construct a heterogeneous signcryption scheme. In addition, two cryptography systems use different secret master keys. Furthermore, the proposed scheme has the indistin-guishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen-message attacks in the random oracle model. Through the data analysis, this scheme is more effective than other similar types of scheme.

Highlights

  • Data confidentiality and authentication should be ensured when transmitting data in public networks

  • In 2016, Zhang et al.[8] proposed a Heterogeneous Signcryption (HSC) scheme that communicates from Certificateless Public Key Cryptography (CLPKC)

  • The present paper introduces a formal security model called Efficient CLPKC-to-Identity-based Public Key Cryptography (IDPKC) Heterogeneous Signcryption Scheme and proves the model’s semantic security and existential unforgeability in the random oracle model [14]

Read more

Summary

Introduction

Data confidentiality and authentication should be ensured when transmitting data in public networks. Proposed the HSC scheme that communicates from Traditional Public Key Instruction (TPKC) to Identity-based Public Key Cryptography (IDPKC)[3]. Li et al [7] proposed a two-way HSC scheme These HSC schemes only consider the signcryption problem between IDPKC and TPKC. These schemes use different public key cryptosystems, the sender and the receiver use the same system parameters. In 2016, Zhang et al.[8] proposed a HSC scheme that communicates from Certificateless Public Key Cryptography (CLPKC). To the best of our knowledge, only four HSC schemes have been developed, and the signcryption problem between IDPKC and CLPKC has not been addressed in the literature.

Related knowledge
Hard Problems
Semantic security
Confidentiality
Unforgeability I
Unforgeability II
Describe the scheme
Performance analysis
Conclusion
Full Text
Published version (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