Research Article
A New Signcryption Scheme Based on Elliptic Curves
@INPROCEEDINGS{10.1007/978-3-030-21373-2_43, author={Wen-jun Cui and Zhi-juan Jia and Ming-sheng Hu and Bei-Gong and Li-peng Wang}, title={A New Signcryption Scheme Based on Elliptic Curves}, proceedings={Security and Privacy in New Computing Environments. Second EAI International Conference, SPNCE 2019, Tianjin, China, April 13--14, 2019, Proceedings}, proceedings_a={SPNCE}, year={2019}, month={6}, keywords={Public verifiability Forward security Unforgeability Model multiplication}, doi={10.1007/978-3-030-21373-2_43} }- Wen-jun Cui
Zhi-juan Jia
Ming-sheng Hu
Bei-Gong
Li-peng Wang
Year: 2019
A New Signcryption Scheme Based on Elliptic Curves
SPNCE
Springer
DOI: 10.1007/978-3-030-21373-2_43
Abstract
Based on the intractable problem of discrete logarithm in ECC and the intractability of reversing a one-way hash function, this paper presents a signcryption scheme with public verifiability and forward security. In the process of security proof, the unforgeability ensures that the attacker can’t create a valid ciphertext. We verify the cipher text instead of the plain text in verification phase. We protect the plain text , which makes the proposed scheme confidential. Thus, the proposed scheme has the property of public verification. And the scheme ensures that if the sender’s private key is compromised, but the attacker can’t recover original message from cipher text . By the performance analysis, our proposed scheme mainly uses the model multiplication. Compared with Zhou scheme, the number of model multiplication has lost one time in signcryption phase, which leads to the significant increase in calculation rate. Moreover, the signature length has lost compared with Zhou scheme. In other words, the minimum value of complexity is reached in theory. This makes the scheme have higher security and wider applications.
