Jiang Yong-he
Abstract
This paper proposed a new secure and efficient ID-based generalized signcryption scheme using the bilinear pairings.Its confidentiality and unforgeability were proved in ROM under BDH assumption and CDH assumption.Finally,analyzed the efficiency of the scheme.It shows that the scheme has higher efficiency.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper proposed a new secure and efficient ID-based generalized signcryption scheme using the bilinear pairings.Its confidentiality and unforgeability were proved in ROM under BDH assumption and CDH assumption.Finally,analyzed the efficiency of the scheme.It shows that the scheme has higher efficiency.
Key concepts: Signcryption, Computer science, Scheme (mathematics), Bilinear interpolation, Confidentiality, Theoretical computer science, Random oracle, Computer security