It is widely believed that hyper elliptic curve cryptosystems (HECCs) are not attractive for wireless sensor network because of their complexity compared with systems based on lower genera, especially elliptic curves. Our contribution shows that for low cost security applications HECs cryptosystems can outperform elliptic curve cryptosystems. The aim of this paper is to propose a discrete logarithm problem-based lightweight secure communication system using HEC. We propose this for different genus curves over varied prime fields performing a full scale study of their adaptability to various types of constrained networks. Also, we propose to evaluate the performance of the protocol for computational times with respect to different genus for main operations like Jacobian, Divisor identifications, key generation, signature generation/verification, message encryption, and decryption by changing the size of the field. A formal security model was established based on the hardness of HEC-Decision Diffie-Hellman (HEC-DDH). Finally, a comparative analysis with ECC-based cryptosystems was made, and satisfactory results were obtained. KEYWORDSDiffie-Hellman, elliptic curve, genus, hyper elliptic curve, Jacobian, wireless sensor networks | INTRODUCTIONIn modern world, most of the wireless systems require resource constrained devices such as RFID tags, sensors, smart cards, small processors, PDA's, and smart phones. These devices play a major role in providing security for satellite communication, internet security, e-banking, e-commerce, Internet Of Things (IOT) applications, and embedded systems. Implementing security for wireless communication system using these devices is the most challenging problem. Many cryptographic algorithms were developed to accomplish their requirements for secure data communication in wireless systems. These algorithms have many limitations, which include increased power consumption, communication, and computational complexity with increased processing time. Thus, an efficient cryptographic algorithm that overcomes these limitations is the need of the hour.Public key cryptography (PKC) 1 offers a solution to the above limitations by using 2 different keys known as the public and private keys. The secret (private) key is chosen by the user and is well known only to him. The public key is computed from the private key by using a reversible mathematical process and is made open to all. Both the keys are interoperable on each other and are used for the decryption and encryption processes. As the private key is never revealed, PKC is highly secured unlike symmetric key cryptography. Based on the arithmetic operations, PKC is broadly
This paper proposes a new two round authenticated contributory group key agreement (ACGKA) protocol based on elliptic curve Diffie-Hellman (ECDH) with integrated signature. In this technique, one node is picked up as the group controller, and this node runs an authenticated ECDH with the rest of the nodes to generate an authenticated shared key per each twoparty. It then merges these keys in another round in such a way that every member obtains the identical authenticated group key. Further, ACGKA is extended to dynamic ACGKA protocol. The dynamic ACGKA, being elliptic curve decisional Diffie Hellman-based, is less expensive and well suited for resource constrained networks such as mobile ad-hoc networks, and wireless sensor network. Also, we demonstrate that all the protocols proposed in this paper are provably secure in the standard model under ECDDH assumption and moreover secure against most of the active and passive attacks. Finally, the proposed protocol is compared with other prevalent ECDH and Diffie Hellman based group key agreement protocols, and results are found to be satisfactory. The simplicity and the elegance of the two-party D-H key agreement [13] motivated many researcher to extend D-H to group settings. Most of the GKA protocols are discrete logarithm problem (DLP) based. However, larger key lengths and heavier computational loads are very much critical for ad-hoc networks. The logical solution to this end is to employ elliptic curve cryptography [14,15], because it can provide high security with smaller key sizes, lesser computational expenses, and greater efficiency. In view of the aforementioned qualities elliptic curve discrete logarithm problem (ECDLP) based key agreement protocols are a natural solution to resource constrained networks such as mobile ad-hoc networks (MANETS) and wireless secure network (WSN). Apart from authentication, the dynamic nature of the protocol, namely, refreshing of GK as soon as members join and/or leave the group is now an integral part of several of these protocol investigations as else the
WANETS provide whenever-wherever networking amenities for communication establishment through the public wireless medium. In this environment, Secure-GKA and proficient group key management are known to be complicated tasks with respect to both computational and algorithmic points of view because of resource constraints in WANET [1]. There is an extensive range of applications for WANET which includes emergency medical services deployed in various environments which can considerably improve the quality of medical care; military applications, rescue missions, collaborative
In this paper a new two-round authenticated contributory group key agreement based on Elliptic Curve Diffie-Hellman protocol with Privacy Preserving Public Key Infrastructure (PP-PKI) is introduced and is extended to a dynamic authenticated contributory group key agreement with join and leave protocols for dynamic groups. The proposed protocol provides such security attributes as forward secrecy, backward secrecy, and defense against man in the middle (MITM) and Unknown keyshare security attacks and also authentication along with privacy preserving attributes like anonymity, traceability and unlinkability. In the end, they are compared with other popular Diffie-Hellman and Elliptic Curve Diffie-Hellman based group key agreement protocols and the results are found to be satisfactory. Keywords. Secure group communication (SGC); mobile ad-hoc networks (MANETS); dynamic authenticated group key agreement (DAGKA); elliptic curve Diffie-Hellman (ECDH); privacy preserving public key infrastructure (PP-PKI).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.