Diffie-Hellman Key Agreement Protocol Research Articles

Elementary Analysis of the Communication Complexity of Divide-and-Conquer Diffie-Hellman Key Agreement Protocol

We present a rigorous elementary analysis of the communication complexity of the Divide-and-Conquer Diffie-Hellman Key Agreement Protocol (DC-DHKA). The analysis is conducted by first determining the number of transmissions in DC-DHKA and then comparing the resulting communication complexity of this protocol with other variants of Diffie-Hellman key agreement protocols that utilize regular Diffie-Hellman key, namely the ING, GDH.1, GDH.2, and GDH.3 protocols. The mathematical and numerical analyses show that the total number of bits transmitted in the DC-DHKA protocol is always fewer than those of ING, GDH.1, and GDH.2 protocols for a group of N >= 19 participants. In addition, we also prove that the total number of bits required for the entire messages’ transmissions in DC-DHKA protocol for N participants that uses the multiplicative group Fq* is log2(q) 2^(log2(N)) (log2(N) + 1) - 2.

Secure Location-Aided Routing Protocols With Wi-Fi Direct For Vehicular Ad Hoc Networks

Secure routing protocols are proposed for the vehicular ad hoc networks. The protocolsintegrate the security authentication process with the Location-Aided Routing (LAR) protocol to supportWi-Fi Direct communications between the vehicles. The methods are robust against various security threats.The security authentication process adopts a modified Diffie-Hellman key agreement protocol. The Diffie-Hellman protocol is used with a short authentication string (SAS)-based key agreement over Wi-Fi Directout-of-band communication channels. It protects the communication from any man-in-the-middle securitythreats. In particular, the security process is integrated into two LAR routing schemes, i.e., the request-zoneLAR scheme and the distance-based LAR scheme.We conduct extensive simulations with different networkparameters such as the vehicular node density, the number of the malicious nodes, and the speed of thenodes. Simulation results show that the proposed routing protocols provide superior performance in securedata delivery and average total packet delay. Also, the secure distance-based LAR protocol outperforms thesecure request-zone LAR protocol.

Secure Optimized Request Zone Location-Aided Routing

Secure data transmission is one of the biggest challenges for Vehicular Ad Hoc Networks (VANETs) due to its dynamic and infrastructure-less characteristics. Such security services become a demand to provide safe and secure conversation between automobiles. In this paper, two optimized secure routing protocol for VANETs were proposed: 1) Secure Tilted-Rectangular-Shaped Request Zone Location-Aided Routing protocol (STRS-RZLAR); 2) Secure Cone-Shaped Request Zone LAR (SCS-RZLAR). Each proposed secure protocol integrates a security unit with an optimized shape request zone. The security unit in both protocols is a multi-layer unit that adopts two security agreement protocols: 1) modified Diffie-Hellman key agreement protocol; 2) short authentication string (SAS)-based key agreement protocol. The overall communication scheme is performed using Wi-Fi Direct out-of-band channels. The proposed secure protocols provide a reliable and secure data transmission between automobiles in a VANET and thus making it robust against man-in-the-middle attack (MITMA). Extensive simulations using three main network parameters: vehicular node density, number of malicious nodes and vehicle speed show that the proposed secure routing protocols provide superior performance regarding data delivery and normalized routing load (NRL) with a trade-off in average end to end packet delay. From the other side, Simulation results show that SCS-RZLAR protocol outperforms the STRS-RZLAR protocol regarding NRL and average end to end packet delay, while STRS-RZLAR protocol outperforms the SCS-RZLAR protocol regarding data delivery.

Efficient elliptic curve Diffie‐Hellman computation at the 256‐bit security level

In this study, the authors introduce new Montgomery and Edwards form elliptic curves targeted at the 256-bit security level. To this end, they work with three primes, namely $p_1:= 2^{506} - 45$p 1 :=2506-45, $p_2:= 2^{510} - 75$p 2 :=2510-75 and $p_3:= 2^{521} - 1$p 3 :=2521-1. While $p_3$p 3 has been considered earlier in the literature, $p_1$p 1 and $p_2$p 2 are new. They define a pair of birationally equivalent Montgomery and Edwards form curves over all the three primes. Efficient 64-bit assembly implementations targeted at Skylake and later generation Intel processors have been made for the shared secret computation phase of the Diffie-Hellman key agreement protocol for the new Montgomery curves. Curve448 of the Transport Layer Security, Version 1.3 is a Montgomery curve which provides security at the 224-bit security level. Compared to the best publicly available 64-bit implementation of Curve448, the new Montgomery curve over $p_1$p 1 leads to a 3-4% slowdown and the new Montgomery curve over $p_2$p 2 leads to a 4.5-5% slowdown; on the other hand, 29 and 30.5 extra bits of security, respectively, are gained. For designers aiming for the 256-bit security level, the new curves over $p_1$p 1 and $p_2$p 2 provide an acceptable trade-off between security and efficiency.

Optimal strategies for CSIDH

<p style='text-indent:20px;'>Since its proposal in Asiacrypt 2018, the commutative isogeny-based key exchange protocol (CSIDH) has spurred considerable attention to improving its performance and re-evaluating its classical and quantum security guarantees. In this paper we discuss how the optimal strategies employed by the Supersingular Isogeny Diffie-Hellman (SIDH) key agreement protocol can be naturally extended to CSIDH. Furthermore, we report a software library that achieves moderate but noticeable performance speedups when compared against state-of-the-art implementations of CSIDH-512, which is the most popular CSIDH instantiation. We also report an estimated number of field operations for larger instantiations of this protocol, namely, CSIDH-1024 and CSIDH-1792.</p>

A new multi-layer RGB image encryption algorithm based on Diffie-Hellman cryptography associated with FrDCT and arnold transform

To protect sensitive data from unauthorized access is a prime agenda nowadays. Cryptography helps us to achieve this goal. An image encryption algorithm for the secure transmission of image data over a public communication channel is proposed. The encryption algorithm uses encryption scheme based on Diffie-Hellman key agreement protocol, fractional discrete cosine transform and Arnold transform. The earlier developed encryption algorithms, pixel values are not disturbed. They are only shifted to other coordinate positions. However, in our approach, pixel values are both disturbed and moved to different coordinate locations. The proposed scheme is secure in both time and frequency domain and gives multi-layer security for RGB image data. In contrast to similar schemes available in the literature, the security of our proposed technique depends upon shared secret keys, and their proper arrangements. The proposed encryption algorithm is susceptible to secret keys. A complete simulation analysis is provided to verify the validity of the algorithm.

Secure Location-Aided Routing Protocols With Wi-Fi Direct For Vehicular Ad Hoc Networks

Secure routing protocols are proposed for the vehicular ad hoc networks. The protocolsintegrate the security authentication process with the Location-Aided Routing (LAR) protocol to supportWi-Fi Direct communications between the vehicles. The methods are robust against various security threats.The security authentication process adopts a modified Diffie-Hellman key agreement protocol. The Diffie-Hellman protocol is used with a short authentication string (SAS)-based key agreement over Wi-Fi Directout-of-band communication channels. It protects the communication from any man-in-the-middle securitythreats. In particular, the security process is integrated into two LAR routing schemes, i.e., the request-zoneLAR scheme and the distance-based LAR scheme.We conduct extensive simulations with different networkparameters such as the vehicular node density, the number of the malicious nodes, and the speed of thenodes. Simulation results show that the proposed routing protocols provide superior performance in securedata delivery and average total packet delay. Also, the secure distance-based LAR protocol outperforms thesecure request-zone LAR protocol.

Securing Information for Commercial File Sharing by Combining Raster Graphic a nd Vector Graphic Stseganographies

Commercial applications cannot declare use of steganography as its security model so as not to spoil the norm of “hidden” secret. Proposed paper suggests a model that can withhold security even after declaration of steganography’s presence allowing applicability in commercial scope. File to be secured is compressed and converted to byte stream and hidden in both raster graphic and vector graphic cover images and encapsulated in a PDF and shared. To extract the secured file from the cover images a key is required by the party intending to receive the secured file. This key is shared by Elliptic Curve Diffie Hellman Key Agreement Protocol. The intended receiver extracts the file by applying steganalysis. To implement this model an android application is developed that shares files by securing it in aforesaid fashion and transferring them via Wi-Fi Direct. Most of the digital image steganography researched are based on raster graphic cover images. The proposed model is designed so that limitations present in raster and vector steganographies each can be counterfeited to produce a secure solution that can be offered in digital image steganography. This solution is suggested as security model in commercial scope.

Development of SETUP-free cryptographic protocols

Today, hybrid cryptosystems are important part in structure of information telecommunication systems. That's why information security measures are extremely crucial at each stage of cryptosystem development life cycle. One of the most important specific of modern cryptosystems is the fact, that they often deployed in unprotected environment and outside the physically secured perimeter. That introduces new attack vectors, e.g. kleptographic attacks which include implementation forgery at endpoints. Such attack types are extremely dangerous because of the victim, who is a participant of some restricted area (electronic document flow, payment system, secure communication etc.), may induce threats for non-compromised participants (e.g., sensitive information leakage). One of the ways to solve mitigate this risks is development subliminal channel free cryptosystems which are resistant against different types of kleptographic attacks. In the article we show results belong to development of SETUP free cryptographic protocol development. Firstly, we suggest formal model for basic ''challenge-response'' protocol with subliminal channel. Using this formal model, we introduce sufficient conditions which lead to impossibility of existence of subliminal channels. Also the theorem about sufficient conditions has been formulated and proved. Further, we suggest improvements of basic protocols -- nonce generation and 1-round Diffie-Hellman key agreement protocol with design that is based of sufficient conditions. Using formalization of suggested enhanced protocols we formulated and proved the theorem about SETUP resistance property for these protocols. Our results may be useful for other SETUP free protocols development, this will be helpful for increasing security of hybrid cryptosystem.

A hierarchical identity-based security for delay tolerant networks using lattice-based cryptography

Routing and secure communication are important concerns in Delay Tolerant Networks (DTNs). Previously designed security schemes utilize traditional public key cryptosystems for entity and data security that provide security under some hard problems like integer factorization and discrete logarithmic problems. These algorithms are vulnerable to Quantum attacks. In this paper lattice based cryptosystem has been used first time for DTN security. Lattice based cryptosystems utilize post-quantum cryptographic algorithms which are unbreakable by quantum attacks. First we present a novel Hierarchical structure for DTN having intracluster and intercluster communications. Then, we propose a security design to provide end-to-end security to DTN application data using lattice based cryptographic signature and encryption algorithms, secure under LWE hard problem over lattices. For securing intracluster and intercluster communication, three new schemes have been proposed: (i) Lattice based hierarchical identity-based key agreement scheme, based on lattice based Diffie-Hellman key agreement protocol, secure under LWE assumption but adapted to hierarchical structure. (ii) To derive new session keys, i.e. keys for new joining nodes and for key refreshment, a new lattice based hierarchical identity-based key update scheme has been proposed, which is based on Singh et al.’s lattice based forward secure identity-based encryption algorithm, (iii) A lattice based non-interactive key agreement scheme, based on schemes proposed by Agrawal et al. and Singh et al., has been proposed for generating a secret key for two communicating nodes in different clusters. This design can effectively resist man-in-the-middle attack, replay attack, dictionary attack, and parallel session attack and maintains forward and backward secrecy.

Secure Tilted-Rectangular-Shaped Request Zone Location-Aided Routing Protocol (STRS-RZLAR) for Vehicular Ad Hoc Networks

Securing data communication in Vehicular Ad Hoc Networks (VANETs) becomes a demand to provide safe and secure warning messages to drivers. In this paper, a secure routing protocol for VANETs was proposed. The protocol integrates a security unit that adopts a modified Diffie-Hellman key agreement protocol with an optimized location-aided routing protocol (LAR) that adopts a tilted rectangular shaped (TRS) request zone. The proposed Secure Tilted-Rectangular-Shaped Request Zone Location-Aided Routing Protocol (STRS-RZLAR) provides a secure communication between vehicles in VANETs and thus protects the overall communication scheme from man-in-the-middle attack (MITMA). By conducting extensive simulation results using two main network parameters: vehicular node density and the number of the malicious nodes, the proposed routing protocol outperforms the insecure TRS-LAR and the standard LAR in terms of secure data delivery.

Path Hopping: An MTD Strategy for Long-Term Quantum-Safe Communication

Moving target defense (MTD) strategies have been widely studied for securing computer systems. We consider using MTD strategies to provide long-term cryptographic security for message transmission against an eavesdropping adversary who has access to a quantum computer. In such a setting, today’s widely used cryptographic systems including Diffie-Hellman key agreement protocol and RSA cryptosystem will be insecure and alternative solutions are needed. We will use a physical assumption, existence of multiple communication paths between the sender and the receiver, as the basis of security, and propose a cryptographic system that uses this assumption and an MTD strategy to guarantee efficient long-term information theoretic security even when only a single path is not eavesdropped. Following the approach of Maleki et al., we model the system using a Markov chain, derive its transition probabilities, propose two security measures, and prove results that show how to calculate these measures using transition probabilities. We define two types of attackers that we call risk-taking and risk-averse and compute our proposed measures for the two types of adversaries for a concrete MTD strategy. We will use numerical analysis to study tradeoffs between system parameters, discuss our results, and propose directions for future research.

Practical Secret Key Agreement for Full-Duplex Near Field Communications

Near Field Communication (NFC) is a promising short distance radio communication technology for many useful applications. Although its communication range is short, NFC alone does not guarantee secure communication and is subject to security attacks, such as an eavesdropping attack. Generating a shared key and using symmetric key cryptography to secure the communication between NFC devices is a feasible solution to prevent various attacks. However, conventional Diffie-Hellman key agreement protocol is not preferable for resource constrained NFC devices due to its extensive computational overhead and energy consumption. In this paper, we propose a practical, fast and energy-efficient key agreement scheme, which uses random bits transmission with waveform shaking, for NFC devices by exploiting its off-the-shelf full-duplex capability. In the proposed method, two devices send random bits to each other simultaneously without strict synchronization or perfect match of amplitude and phase. On the contrary, the method randomly introduces synchronization offset and mismatch of amplitude and phase for each bit transmission in order to prevent a passive attacker from determining the generated key. A shared bit can be established when two devices send different bits. We conduct theoretical analysis on the correctness and security strength of the method, and extensive simulations to evaluate its effectiveness. We build a testbed based on USRP software defined radio and conduct proof-of-concept experiments to evaluate the method in a real-world environment. It shows that the proposed method achieves a high key generation rate of about 26 kbps and is immune to eavesdropping attack even when the attacker is within several centimeters from the legitimate devices. The proposed method is a practical, fast, energy-efficient, and secure key agreement scheme for resource-constrained NFC devices.

A quantum Diffie-Hellman protocol

In this paper, a quantum version of Diffie-Hellman key agreement protocol is developed using the commutative rotation transformations. Qubits rotated by secret rotation angles and exchanged over a quantum channel are appropriately measured to form a secret shared key. Additional 'slack' rotations are used to ensure that measurement of the commutative transformations always result in the same bit value, for legitimate party, in the absence of an eavesdropper. The performance of the quantum protocol is evaluated in terms of the number of exchanges needed for a given key size and the probability of detecting an eavesdropper. We also compare the proposed protocol with BB84.

Efficient group Diffie-Hellman key agreement protocols

Display Omitted Authenticated group Diffie-Hellman (GDH) key agreement protocols are proposed.GDH key agreement protocols are based on the secret sharing.Our proposed solution is efficient, robust ...

Weakness and Improvement of an Efficient Key Agreement Protocol

Xiao and Li proposed protocol XKAS and claimed it to be an efficient and secure two-party authenticated Diffie-Hellman key agreement protocol. In this letter, we show that the protocol is vulne- rable to a key-compromise impersonation attack. We also proposed XKAS+, which can withstand such attacks. The new protocol enjoys this property at the expense of a slight increase in computational workload with respect to the original version.

Efficient group Diffie–Hellman key agreement protocols

In a group Diffie–Hellman (GDH) key agreement protocol, all group members collaboratively establish a group key. Most GDH key agreement protocols took natural generalization of the original Diffie–Hellman (DH) key agreement protocol to arrange all group members in a logic ring or a binary tree and to exchange DH public keys. The computational cost and the communication rounds are the two most important factors that affect the efficiency of a GDH protocol when there are a large number of group members. In this paper, we propose GDH key agreement protocols based on the secret sharing scheme. In addition, we use a one-way key confirmation and digital certificates of DH public keys to provide authentication of group keys. In the proposed authenticated GDH key agreement protocol, each group member requires to broadcast three-round messages, n modular exponentiations, n polynomial interpolations and n one-way functions. Our proposed solution is efficient, robust and secure.

Secure Device Pairing: A Survey

In this paper, we discuss secure device pairing mechanisms in detail. We explain man-in-the-middle attack problem in unauthenticated Diffie-Hellman key agreement protocols and show how it can be solved by using out-of-band channels in the authentication procedure. We categorize out-of-band channels into three categories of weak, public, and private channels and demonstrate their properties through some familiar scenarios. A wide range of current device pairing mechanisms are studied and their design circumstances, problems, and security issues are explained. We also study group device pairing mechanisms and discuss their application in constructing authenticated group key agreement protocols. We divide the mechanisms into two categories of protocols with and without the trusted leader and show that protocols with trusted leader are more communication and computation efficient. In our study, we considered both insider and outsider adversaries and present protocols that provide secure group device pairing for uncompromised nodes even in presence of corrupted group members.

Secure Access to Private Services in Intranet for Mobile Clients

With wide adoption of Service Computing and Mobile Computing, people tend to invoke services with mobile devices, requiring accurate and real-time feedback from services at any time and any place. Among these services, some are private to limited users and require identity authorization before use; hence secure access control in wireless network should be provided. To address the challenge, in this study, we propose the architecture and protocols of a system of access to private services for mobile clients, which combines the technologies of trusted computing, Diffie-Hellman key agreement protocol, digital certificate, DES data encryption algorithm and twice verification. We further show the implementation of the proposed system, in which we have realized the authentication and authorization of mobile clients and then secure data transfer between mobile clients in the unsafe Internet and private services in the Intranet.

Secure Access Control Guarding Against Internal Attacks in Distributed Networks

In this paper, we propose a secure and efficient trust scheme with Bayesian theory to detect whether a node is malicious or not. In order to improve the correctness of detecting behavior, we aim to consider the influence with respect to the internal attacks of compromised nodes as many as possible. Moreover, the information of malicious behaviors is collected by their neighboring nodes and fused by the foregoing hop nodes. And then, the trust value concerning some node is computed by its father node in a route. Moreover, the key exchange of a secure route is implemented by the modified Diffie–Hellman key agreement protocol to guard against man-in-the-middle attack. The simulation results show that, with the increase of trust ratio, the Bayesian theorem can make more credible judgment on whether the network nodes are secure than the Beta function and the efficient clustering scheme for group key management in the present of malicious nodes.