Abstract
Rivest, Shamir, & Adleman (RSA), bilinear pairing, and elliptic curve are well-known techniques/algorithms for security protocols. These techniques suffer from higher computation and communication costs due to increased sizes of parameters, public keys, and certificates. Hyper-elliptic curve has lower parameter size, public key size, and certificate size. The aim of the proposed work is to reduce the computational cost and communication cost. Furthermore, we validate the security properties of our proposed scheme by using the well-known simulation tool called automated validation of Internet security protocols and applications. Our approach ensures security properties such as resistance against replay attack, confidentiality, authenticity, unforgeability, integrity, non-repudiation, public verifiability, and forward secrecy.
Highlights
In the early decades of the Internet, people used particular techniques for secure communication.With its rapid development, security has gradually become more important
We propose a provable secured signcryption scheme based on a hyper-elliptic curve which will provide all security features along with low computational and communication cost
The hyper-elliptic curve works on divisor D which is branded as the formal and finite sum of points on a hyper-elliptic curve that can be further symbolized by Mumford as: g−1
Summary
Insaf Ullah 1,2, *, Noor Ul Amin 1 , Junaid Khan 3 , Muhammad Rehan 3 , Muhammad Naeem 3 , Hizbullah Kha ak 1 , Shah Jahan Kha ak 4 and Haseen Ali 3. Departement of Information Technology, Abbotabad University of Science and Technology, Khyber Pakhtunkhwa 22010, Pakistan. Pakistan Engineering Council (PEC), A atruk Avenue (East) Sector G-5/2, Islamabad 44000, Pakistan
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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
