An Efficient Signcryption Scheme with Forward Secrecy
Jianfeng Ma
Abstract
Jianfeng Ma
Abstract
Based on the modification of the standard signature algorithm DSA,an efficient signcryption scheme with forward secrecy was designed.The new scheme has lower communication overhead than the others before.Presumed the difficulty of Computational Diffie-Hellman Problem,the security proofs for the new scheme is given in the random oracle model.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
Based on the modification of the standard signature algorithm DSA,an efficient signcryption scheme with forward secrecy was designed.The new scheme has lower communication overhead than the others before.Presumed the difficulty of Computational Diffie-Hellman Problem,the security proofs for the new scheme is given in the random oracle model.
Key concepts: Signcryption, Random oracle, Scheme (mathematics), Mathematical proof, Computer science, Forward secrecy, Secrecy, Theoretical computer science