Diffie-Hellman Research Articles

Enhancing security in Wireless Body Area Networks (WBANs) with ECC-based Diffie-Hellman Key Exchange algorithm (ECDH).

Wireless Body Area Networks (WBANs) are integral to modern healthcare systems, providing continuous health monitoring and real-time data transmission. The sensitivity of medical data being transmitted makes security a significant concern in WBANs. This study explores the application of the Elliptic Curve Cryptography (ECC)-based Diffie-Hellman Key Exchange (ECDH) algorithm to enhance security within WBANs. The study investigates the suitability of ECC for this context and evaluates the performance and security implications of implementing ECDH in WBANs. The findings reveal that ECDH provides a robust and computationally efficient solution for secure key exchange in WBANs, addressing inherent vulnerabilities. The adoption of ECC-based ECDH is poised to bolster data confidentiality and integrity in WBANs, promoting trust and widespread use of these networks in healthcare applications. This research contributes to the growing body of knowledge regarding security measures in WBANs and opens new avenues for the secure transmission of sensitive medical information.

DSDOS Cloud: A Decentralized Secure Data Outsourcing System With Hybrid Encryption, Blockchain Smart Contract‐Based Access Control, and Hash Authentication Codes for Cloud Security

ABSTRACTWith the increasing trend of outsourcing data to cloud services, ensuring data security and privacy has become crucial. Typically, data are stored on cloud servers in encrypted form to mitigate risks. However, accessing the encrypted data requires an access key distributed by a third party. If this third party is untrustworthy, it poses a significant security threat to the system. To address this challenge, we propose a Decentralized Secure Data Outsourcing System (DSDOS) that uses blockchain technology to ensure data security and privacy. The DSDOS system comprises three modules: data security and privacy, access control and authorization, and data integrity and availability. The data security and privacy module uses a hybrid encryption scheme that combines Advanced Encryption Standard (AES), partially homomorphic encryption (PHE), and Diffie–Hellman (DH) to ensure secure data storage and access. The access control and authorization module uses a blockchain‐based smart contract system to manage access to the encrypted data. The data integrity and availability module uses hash‐based message authentication code (HMAC) to ensure that the data are not tampered with and is always available. We conducted a security and performance analysis of the DSDOS system and found that it outperforms previous schemes in terms of security and performance. The DSDOS system is a secure and privacy‐preserving data outsourcing system that can be used to mitigate the security risks associated with traditional cloud storage systems.

SERAV Deep-MAD: Deep Learning-Based Security–Reliability–Availability Aware Multiple D2D Environment

The tremendous growth of internet-connected devices can lead to network congestion, making it essential to incorporate new technologies to optimize performance. Thus, Device to Device(D2D) communication has been deemed as an emerging technology that can be used to communicate efficiently. However, establishing a secure and reliable mechanism for Device-to-Device (D2D) communication that ensures security, reliability, and availability poses a significant challenge. To tackle these issues a novel deep learning-based security-reliability-availability aware multiple D2D environment (SERAV Deep-MAD) has been proposed for Secure D-2-D Communication in a Fog environment. The proposed method utilizes a Fully Homomorphic Quantum Diffie Hellman Encryption (FHQDHE) to secure the data while transmitting. The proposed method utilizes the novel secure Quantum Diffie Hellman key exchange (QDHKE) technique for sharing the key to transform the plain data into cipher data, then applies FH operations on the encrypted data before transferring it to the Fog environment. Whenever a client requests data from the Fog, the Fog provider verifies the client's access rights. Moreover, the Attention-based Bi-GRU model is utilized to categorize whether the device is non-attack or attack, if the data is attacked then the proposed model classifies multiple attacks. The NS2 Simulator is used to verify and validate the proposed SERAV Deep-MAD model, and resiliency analysis is done to assess performance. The proposed techniques attain a higher accuracy of 98.18% which is 1.58%, 2.02%, and 2.41% better than MECC, MIMO, andAAKA-D2D respectively.

Scenarios for Optical Encryption Using Quantum Keys

Optical communications providing huge capacity and low latency remain vulnerable to a range of attacks. In consequence, encryption at the optical layer is needed to ensure secure data transmission. In our previous work, we proposed LightPath SECurity (LPSec), a secure cryptographic solution for optical transmission that leverages stream ciphers and Diffie–Hellman (DH) key exchange for high-speed optical encryption. Still, LPSec faces limitations related to key generation and key distribution. To address these limitations, in this paper, we rely on Quantum Random Number Generators (QRNG) and Quantum Key Distribution (QKD) networks. Specifically, we focus on three meaningful scenarios: In Scenario A, the two optical transponders (Tp) involved in the optical transmission are within the security perimeter of the QKD network. In Scenario B, only one Tp is within the QKD network, so keys are retrieved from a QRNG and distributed using LPSec. Finally, Scenario C extends Scenario B by employing Post-Quantum Cryptography (PQC) by implementing a Key Encapsulation Mechanism (KEM) to secure key exchanges. The scenarios are analyzed based on their security, efficiency, and applicability, demonstrating the potential of quantum-enhanced LPSec to provide secure, low-latency encryption for current optical communications. The experimental assessment, conducted on the Madrid Quantum Infrastructure, validates the feasibility of the proposed solutions.

Emergency Medical Access Control System Based on Public Blockchain

IT has made significant progress in various fields over the past few years, with many industries transitioning from paper-based to electronic media. However, sharing electronic medical records remains a long-term challenge, particularly when patients are in emergency situations, making it difficult to access and control their medical information. Previous studies have proposed permissioned blockchains with limited participants or mechanisms that allow emergency medical information sharing to pre-designated participants. However, permissioned blockchains require prior participation by medical institutions, and limiting sharing entities restricts the number of potential partners. This means that sharing medical information with local emergency doctors becomes impossible if a patient is unconscious and far away from home, such as when traveling abroad. To tackle this challenge, we propose an emergency access control system for a global electronic medical information system that can be shared using a public blockchain, allowing anyone to participate. Our proposed system assumes that the patient wears a pendant with tamper-proof and biometric authentication capabilities. In the event of unconsciousness, emergency doctors can perform biometrics on behalf of the patient, allowing the family doctor to share health records with the emergency doctor through a secure channel that uses the Diffie-Hellman (DH) key exchange protocol. The pendant’s biometric authentication function prevents unauthorized use if it is stolen, and we have tested the blockchain’s fee for using the public blockchain, demonstrating that the proposed system is practical.

An Approach for Cipher Communication Utilizing the Concepts of Elliptic Curve Cryptography

Message encryption is a process of protection of the original data in transmission. Several cryptosystems were designed in the history for different environments. Public key or Asymmetric cryptosystem has become more popular in recent era where the key space consists both public and private keys. Elliptic curve cryptography dominates public key cryptosystems like Diffie Hellman key exchange and RSA. ECC is more powerful and alternative technique of RSA, with a simple replacement of exponent calculations of large prime numbers to mathematical representation of Elliptic curve points. Besides the computation ECC works with shorter key length than RSA. The present paper describes an encryption algorithm using elliptic curves over finite fields. Here a group of authentic users transmit.

Quaternary Tree Group Diffie- Hellman Based Group Key Management Protocol for Dynamic Peer Groups

Diffie-Hellman (DH) protocol for 2-party has made the key exchange to be simple yet powerful. It is widely used in many communication-oriented protocols for establishing the keys in public communication channels. With millions of internet users connected globally and using various group oriented applications, communication among them has to be in a secured manner. Due to its simplicity, DH has been further extended to group setting and number of protocols are developed. Establishing Group Key and regenerating it during membership changes is a challenging task in communication among large groups. This paper proposes a quaternary tree method that uses the key tree concept and Group Diffie Hellman protocol, GDH.3 to establish the common key. GDH.3, an extension of DH for n parties is best suited for large dynamic groups. Quaternary tree reduces the height almost by half as against binary trees, making the rekeying much easier. As the group size increases, GDH.3 outperforms other existing group protocols based on DH, since it requires much lesser number of exponentiations.

Advancing Security in Lightweight S-WBSN for E-Healthcare

Wireless body sensor networks (WBSNs) are a critical component of e-healthcare, enabling continuous monitoring of vital signs and other health parameters. However, the limited capacity of WBSNs poses a significant challenge to securing data transmission. A novel architecture for Secure Wireless Body Sensor Networks (S-WBSN) has been introduced, focusing on efficiency and robust security. The S-WBSN architecture employs a combination of the OTP-Q stream block cipher and the Diffie-Hellman key exchange algorithm to ensure secure data transmission and mutual authentication between critical components. The OTP-Q algorithm encrypts data obtained from WBSN sensors, while the Diffie-Hellman algorithm establishes a secure communication channel between the WBSN, Local Processing Center (LPC), and Data Server. This innovative approach effectively meets essential security requirements, including mutual authentication and privacy preservation. It also demonstrates notable efficiency, consuming fewer CPU cycles than existing state-of-the-art security approaches. Comparative analysis showcases reduced processing time for encryption and decryption, making the S-WBSN architecture an attractive solution for e-healthcare data monitoring security. In summary, the S-WBSN architecture significantly enhances the security posture of e-healthcare data transfer, prioritizing efficiency, and robust protection. It sets itself apart from contemporary healthcare data monitoring security methodologies by delivering a comprehensive solution that addresses the unique challenges of WBSNs.

A Secure Key Exchange Protocol and a Public Key Cryptosystem for Healthcare Systems

Diffie-Hellman (DH) is the reason for the existence of a solution to the key distribution problem, where two parties can mutually set up a shared secret key over an insecure channel without any previous communication. In this study, a novel key exchange protocol based on the difficulty of the Discrete Logarithm Problem with Factor Problem (DLPFP) utilizing matrices in non-commutative semigroup over semiring is proposed. The security and complexity analyses of the protocol are discussed. Also, an ElGamal cryptosystem based on a group of invertible matrices and DLPFP over a semiring to encrypt the Sensitive Health Information (SHI) in healthcare systems is suggested.

Cryptographic Application of Elliptic Curve Generated through Centered Hexadecagonal Numbers

Background/Objectives: Elliptic Curve Cryptography (ECC) is a public-key encryption method that is similar to RSA. ECC uses the mathematical concept of elliptic curves to achieve the same level of security with significantly smaller keys, whereas RSA's security depends on large prime numbers. Elliptic curves and their applications in cryptography will be discussed in this paper. The elliptic curve is formed by the extension of a Diophantine pair of Centered Hexadecagonal numbers to a Diophantine triple with property D(8). Method: The Diffie–Hellman key exchange, named for Whitfield Diffie and Martin Hellman, was developed by Ralph Merkle and is a mathematical technique for safely transferring cryptographic keys over a public channel. Based on the Diffie–Hellman key exchange, the ElGamal encryption system is an asymmetric key encryption algorithm for public-key cryptography. The generation of keys, encryption and decryption are the three main operations of the ElGamal cryptosystem. Findings: Given the relative modesty of our objectives, the fundamental algebraic and geometric characteristics of elliptic curves shall be delineated. Then the behaviour of elliptic curves modulo p: ultimately, there is a fairly strong analogy between the structure of the points on an elliptic curve modulo p and the integers modulo n will be studied. In the end, elliptic curve ElGamal encryption analogues of Diffie–Hellman key exchange will be created. Novelty: Elliptic curves are encountered in a multitude of mathematical contexts and have a varied and fascinating history. Elliptic curves are very significant in number theory and are a focus of much recent work. The earlier research works in Elliptic Curve Cryptography has concentrated on computer algorithms and pairing – based algorithms. In this paper, the concept of polygonal numbers and its extension from Diophantine pair to triples is encountered, thus forming an elliptic curve and perform the encryption-decryption process. MSC Classification Number: 11D09, 11D99,11T71,11G05. Keywords: Elliptic curves, Cryptography, Encryption, Decryption, Centered polygonal numbers

Challenges and opportunities on the horizon of post-quantum cryptography

Large quantum computers have the potential to break many cryptographic systems, e.g., Rivest–Shamir–Adleman, Diffie–Hellman key exchange, and the elliptical curve cryptosystem. The Department of Defense (DoD) is aware of this threat, and the National Institute of Standards and Technology is preparing a set of approved encryption and signature schemes that are not susceptible to these attacks by quantum computers, the so-called Post-Quantum Cryptography (PQC). The task of substituting older encryption and signature schemes raises a number of questions, to which there are not yet clear answers. In this research, we investigate the transition to PQC on existing networks, explain the approved PQC schemes, describe the likely path to an adaptation of PQC, and offer forward guidance on challenges and threats that may be encountered in the process of transition to PQC. This paper discusses the impacts of the new PQC schemes on network performance and speculates on possible side-channel attacks on the new encryption scheme. This paper offers hardware/software solutions based on the Split-protocol.

Towards improving the security of wireless networks using secured session keys

ABSTRACT Wireless Networks are mostly based on the IEEE 802.11 standards and with so many applications being wireless, without proper security, sensitive information may be at risk. Wired Equivalent Privacy (WEP) and Wi-Fi Protected Access (WPA) are two of the most commonly used mechanisms for implementing security in wireless networks. However, research has shown that both of these can be cracked quite easily within a short period as these mechanisms use a key-based security implementation for performing operations. The key can be found by capturing a few packets and hence security is compromised. In this study, the solution that is proposed by generating a secured session key using the Advanced Encryption Standard (AES) algorithm, which is valid only for a specific session and cannot be cracked easily by the intruder, and hence will not affect the security of the entire network. The key exchange is made by the Diffie-Hellman key exchange protocol. The proposed solution was implemented over a network and found to be secure.

Authorization of Aadhar data using Diffie Helman key with enhanced security concerns

In today’s digital era, the security of sensitive data such as Aadhaar data is of utmost importance. To ensure the privacy and integrity of this data, a conceptual framework is proposed that employs the Diffie-Hellman key exchange protocol and Hash-based Message Authentication Code (HMAC) to enhance the security. The proposed system begins with the preprocessing phase, which includes removing noise, standardizing formats and validating the integrity of the data. Next, the data is segmented into appropriate sections to enable efficient storage and retrieval in the cloud. Each segment is further processed to extract meaningful features, ensuring that the relevant information is preserved while reducing the risk of unauthorized access. For safeguarding the stored Aadhaar data, the system employs the Diffie-Hellman key exchange protocol which allows the data owner and the cloud service provider to establish a shared secret key without exposing it to potential attackers. Additionally, HMAC is implemented to verify the identity of users during the login process. HMAC enhances security by leveraging cryptographic hash functions and a shared secret key to produce a distinct code for each login attempt. This mechanism effectively protects the confidentiality and integrity of stored data. The combination of Diffie-Hellman key exchange and HMAC authentication provides a robust security framework for Aadhaar data. It ensures that the data remains encrypted and inaccessible without the secret key, while also verifying the identity of users during the login process. This comprehensive approach helps preventing unauthorized access thereby protecting against potential attacks, instilling trust and confidence in the security of Aadhaar data stored in the cloud. Results of the article depict that the proposed scheme achieve 0.19 s of encryption time and 0.05 s of decryption time.

Digital Contact Tracing Solutions: Promises, Pitfalls and Challenges

The COVID-19 pandemic has caused many countries to deploy novel digital contact tracing (DCT) systems to boost the efficiency of manual tracing of infection chains. In this paper, we systematically analyze DCT solutions and categorize them based on their design approaches and architectures. We analyze them with regard to effectiveness, security, privacy and ethical aspects and compare prominent solutions based on these requirements. In particular, we discuss shortcomings of the Google and Apple Exposure Notification API (GAEN) that is currently widely adopted all over the world. We find that the security and privacy of GAEN has considerable deficiencies as it can be compromised by severe large-scale attacks. We also discuss other proposed approaches for contact tracing, including our proposal <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TraceCORONA</small> , that are based on Diffie-Hellman (DH) key exchange and aim at tackling shortcomings of existing solutions. Our extensive analysis shows that <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TraceCORONA</small> fulfills the above security requirements better than deployed state-of-the-art approaches. We have implemented <sc xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">TraceCORONA</small> and its beta test version has been used by more than 2000 users without any major functional problems <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://tracecorona.net/download-tracecorona/</uri> , demonstrating that there are no technical reasons requiring to make compromises with regard to the requirements of DCT approaches.

A survey on lattice‐based security and authentication schemes for smart‐grid networks in the post‐quantum era

SummaryThe present scenario witnesses “the second quantum revolution,” which has enabled the development of revolutionary novel quantum tools. Quantum computing endeavors to establish higher computing standards that can potentially solve complex structures. Post‐quantum cryptography (PQC) has emerged as one of the new domains of cryptography, which is resilient to quantum attacks owing to the revolution in quantum computing. To ensure quantum security, the lattice‐based cryptosystem (LB‐cryptosystem) is one of the promising tools of PQC to address quantum‐based threats. The traditional security algorithms, such as RSA and Diffie–Hellman (DH), are strong enough to resist present security threats. However, it has been predicted that quantum technologies have the capability to break the security of most traditional algorithms whose security is based on prime factorization and DH‐type hard problems. Therefore, research is currently focused on addressing the security and privacy threats by using LB‐cryptosystems to secure various applications, organizations' data, and information infrastructure in the quantum era. The purpose of this article is to investigate recent advances in LB‐cryptosystems that may allow the design of secure models for smart‐grid networks (SGNs) against existing and future quantum attacks. SGNs have been explored as the bi‐directional assimilation of communication in terms of electricity generation, transmission, allocation, and utilization. This survey provides a comprehensive overview of LB‐cryptosystems, as well as their potential applications in securing SGNs. Lastly, the article summarizes the various PQC primitives, NIST selected algorithms, open‐source tools along with their packages, and various PQC industrial initiatives, and also compares traditional cryptographic schemes with other PQC.

Wifi Pentesting Roadmap for Classic-Future Attacks and Defenses

The most advanced attack on the Wireless Fidelity (WIFI) network uses social engineering. The hacker makes portal captive and forces the victim for disconnecting to internet instead of entering the real password of the WIFI. In normal actions, asking WIFI password on the web interface is not the real process, but sometimes the victim is not experience enough on security and thinks that it is a technical problem. Also, the victim didn’t have internet connection due to the hard deauthentication and the select open access, which is not his WIFI network. The future generation of WIFI could be use a secure deauthentication. So, this article proposed how the actual attack will be processed, how is the secure deauthentication and how hacker could use this same attack with more secure network. Like conclusion, solutions to resolve this problem will be proposed. New hacking arsenal for replacing the deauthentication is the smart-jamming. With the secure deauthentication, reforging the packet for telling the victim to deauthenticate to the network will not be possible anymore. The smart-jamming select the frequency of the access point of the victim and jam only this specific frequency by sending a noise. In this scenario, the same effect of the first attack is still possible. For the best security of network, two solutions will be proposed: secure deauthentication and hopping frequency. A defensive proposition about secure deauthentication will be found in this article by using cryptographic key exchange like Diffie Hellman (DH), Elliptic Curve Diffie Hellman (ECDH) and Super Isogenies Diffie Hellman (CSIDH).

TurboBlom: A light and resilient key predistribution scheme with application to Internet of Things.

In the Internet of Things (IoT), there are often devices that are computationally too constrained to establish a security key using traditional key distribution mechanisms such as those based on the Diffie-Hellman key exchange. To address this, current solution commonly rely on key predistribution schemes (KPSs). Among KPSs, the Blom scheme provably provides the highest resilience against node capture attacks. This, however, comes at high computational overhead, because the Blom scheme requires many multiplications over a large finite field. To overcome this computational overhead, we present TurboBlom, a novel amendment of the Blom scheme. TurboBlom circumvents the need for field multiplications by utilizing specialized generator matrices, such as random zero-one matrices. We demonstrate that, through this approach, TurboBlom can significantly reduce the computational overhead of the Blom scheme by orders of magnitude. In our next key finding, we demonstrate that TurboBlom offers a level of resilience against node capture that is virtually on par with the Blom scheme. Notably, we prove that the gap between the resilience of the two schemes is exponentially small. These features of TurboBlom (i.e., low computational overhead and high resilience) make it suitable for computationally constrained devices. Such devices exist in abundance in IoT, for example, as part of Low Power and Lossy Networks (LLNs). To demonstrate a sample application of TurboBlom, we show how to use it to enable sender authentication in the Routing Protocol for LLNs (RPL), a standard routing protocol for IoT.

An image encryption method based on modified elliptic curve Diffie-Hellman key exchange protocol and Hill Cipher

Abstract Digital image protection is crucial since images often contain private and sensitive information in business, medical, and military. One of the best techniques for securing the content of these images is encryption. This article introduces a cryptosystem known as the elliptic curve Diffie-Hellman Hill Cipher (ECDHHC) that uses the modified eliptic curve Diffie-Hellman (ECDH) key exchange protocol to generate the shared secret key integrated with the Hill Cipher. An elliptic curve point-based secret shared key matrix using the ECDHHC, which will be used for encryption and decryption, is generated. Thereafter, the input image is split into a set of 8 × 8 submatrices and then changes the values of these matrices by multiplying each block with the secret shared key matrix. The encrypted image is constructed by merging all encrypted blocks. With this combination, the correlation between adjacent pixels in the ciphered image is effectively removed, and the level of unpredictability and uncertainty for the ciphered image is also enhanced. The suggested approach used the key space, entropy, histogram, antinoise attack, differential attack, and correlation coefficient to evaluate the performance of the encryption method. According to simulation findings, the proposed method offers a high level of security and efficiency, and resists attackers.

Privacy Protection Method for Blockchain Transactions Based on the Stealth Address and the Note Mechanism

Blockchain is a distributed ledger technology that possesses characteristics such as decentralization, tamper resistance, and programmability. However, while blockchain ensures transaction openness and transparency, transaction privacy is also at risk of being exposed. Therefore, this paper proposes the blockchain transaction privacy protection method based on the stealth address and the note mechanism to address the privacy leakage risk in blockchain public environments. Firstly, the proposed method generates a random seed known only to the parties involved based on the Diffie–Hellman key exchange protocol, ensuring the privacy of transactions. Then, it utilizes the Note Commitments table to maintain the binding relationship between the stealth address and the corresponding note, enabling efficient transfer and verification of note ownership. The uniqueness of the stealth address is utilized as an invalidation identifier for notes in the Nullifier table, ensuring efficient verification of the correctness of note invalidation identifiers. Additionally, this method employs Pedersen commitment and Bulletproofs range proof to generate proof of the legality of transaction amounts, enabling the concealment of transaction amounts and facilitating private transactions between the parties involved. Finally, this paper presents a detailed performance analysis, implementation, and testing of the method. From the results, it can be concluded that the method proposed can effectively prevent fraudulent behavior by various transaction participants and ensure the security, privacy, and integrity of the transaction. Critical processes consume only milliseconds, and the related commitments and proofs are also minimal, which is crucial for controlling transaction costs. At the same time, this method achieves a completely decentralized privacy transaction solution.

A Hybrid Cryptographic Mechanism for Secure Data Transmission in Edge AI Networks

As Edge AI systems become more prevalent, ensuring data privacy and security in these decentralized networks is essential. In this work, a novel hybrid cryptographic mechanism was presented by combining Ant Lion Optimization (ALO) and Diffie–Hellman-based Twofish cryptography (DHT) for secure data transmission. The developed work collects the data from the created edge AI system and processes it using the Autoencoder. The Autoencoder learns the data patterns and identifies the malicious data entry. The Diffie–Hellman (DH) key exchange generates a shared secret key for encryption, while the ALO optimizes the key exchange and improves security performance. Further, the Twofish algorithm performs the data encryption using a generated secret key, preventing security threats during transmission. The implementation results of the study show that it achieved a higher accuracy of 99.45%, lower time consumption of 2 s, minimum delay of 0.8 s, and reduced energy consumption of 3.2 mJ.