Provable Secure Identity Based Generalized Signcryption Scheme
Gang Yu, Xiaoxiao Ma, Yong Shen, Wenbao Han

TL;DR
This paper introduces a new identity-based generalized signcryption scheme with a comprehensive security model, demonstrating improved implementation simplicity and comparable computational efficiency to existing schemes.
Contribution
It presents a novel security model for identity-based generalized signcryption and proposes a scheme with proven security and reduced complexity.
Findings
Security model is more complete than previous models.
The new scheme has less implementation complexity.
Computational complexity is comparable to existing signcryption schemes.
Abstract
According to actual needs, generalized signcryption scheme can flexibly work as an encryption scheme, a signature scheme or a signcryption scheme. In this paper, firstly, we give a security model for identity based generalized signcryption which is more complete than existing model. Secondly, we propose an identity based generalized signcryption scheme. Thirdly, we give the security proof of the new scheme in this complete model. Comparing with existing identity based generalized signcryption, the new scheme has less implementation complexity. Moreover, the new scheme has comparable computation complexity with the existing normal signcryption schemes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · graph theory and CDMA systems
