A note on the complexity of breaking Okamoto-Tanaka ID-based key exchange scheme

Proposed paper gives a secure key exchange scheme using block upper triangular matrices of higher order. By using this method it is possible to generate keys of large orders without the need of large primes thereby avoiding the common ciphertext attacks. The element used for generating shared key is the element of (1, 3) block of the matrix which depends upon the elements of (1, 2) as well as on the (2, 3) blocks thereby increasing the hardness of the problem and providing greater security. Moreover our proposal is compared with the method proposed by Alvarez et al. (2009) Key words: Block upper triangular matrices, public key cryptography, polynomial matrices, DH key exchange.

This paper proposes a secure session key exchange and mutual authentication scheme between mobile machines in WLAN-based ad hoc networks. One of the main security challenges for secure machine to machine communication is to accomplish a simple and efficient session key exchange and mutual authentication. The main idea of this paper is that non-interactive session key exchange uses the mobile machine's ID and mutual authentication without communication with an authentication server whenever a data transmission occurs between the mobile machines. The proposed scheme is secure against man-in-the-middle attack, impersonation attack, and modification attack.

Based on mobile devices limitations, several user authentications and key exchange schemes have been proposed for mobile devices using identity-based public key cryptography (ID-PKC). However, these schemes suffer from key escrow problem. Moreover, they are not secure against impersonation attacks, and they can’t achieve perfect forward secrecy. In this paper, a new user authentication and key exchange protocol for the mobile client-server environment is proposed. Certificateless public key cryptography (CL-PKC) and bilinear pairing are adopted in the proposed scheme. Our protocol solves the key escrow problem of identity-based public key cryptography. Also, it is secure against both adversaries type I and type II. Furthermore, the proposed protocol achieves perfect forward secrecy. We prove the security of our protocol in the random oracle model under the Computational Diffie-Hellman (CDH) problem. Hence, the proposed scheme is more suitable for the mobile devices environments.

Wireless sensor network consists of micro electromechanical sensor nodes which are operated by battery power. Sensor network has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The modern researchers are facing the various issues concerning sensor networks more graciously. However, offering security to an energy constrained network of sensor nodes is still a challenge. The proposed scheme named as Secure Cluster Based Routing Scheme (SCBRS) for Wireless Sensor Networks adopts a hierarchical network model coupled with low weight security mechanisms in order to conserve energy as well as offer security to the network. Elliptic Curve Cryptography (ECC) based public key cryptography, Elliptic-Curve Diffie-Hellman (ECDH) key exchange scheme, nested hash based message authentication codes (HMAC) and RC5 symmetric cypher are the light-weight security methods used by the proposed scheme. Simulation results prove that SCBRS performs better than Tree Based Protocol for Key Management in Wireless Sensor Networks in terms of energy efficiency and security. SCBRS also performs better than Secure Hierarchical Routing Protocol (SHRP) in fields where security is the most important issue.

After going through past research, it is observed that the security of data depends on five important key features such as authentication, data Integrity, mutual authentication between two parties, non-repudiation, and key exchange algorithm. Even if one of these features fail then it may breach security in real-world scenarios. The Diffie-Hellman Key Exchange (DHKE) algorithm allows securing one feature called key exchange in the cryptography field. However, this key exchange algorithm is unable to provide authentication. As a result, this key exchange scheme is prone to a hostile attack named as Man-In-The-Middle Attack (MITM). To solve this type of attack, a novel algorithm has been proposed called modification of the DHKE algorithm. In this algorithm, they claim that the MITM attack on classical DHKE can be prevented by applying the necessary functionalities like encryption and Zero-Knowledge Proof (ZKP). Although, after going through result analysis and working techniques, it is observed that the modified DHKE algorithm is still suffering from MITM attack. In this paper, the main objective is to develop an algorithm for finding out this type of security flaw in the existing modified DH algorithm which includes the concept of required authentication and encryption functions and able to perform the MITM attack on the existing modified DHKE algorithm.

Cryptographic algorithms are crucial for secure communication in the Internet of Things (IoT). Quantum computers threaten public key cryptography algorithms like RSA (Rivest, Shamir, Adleman) and Diffie-Hellman (DH) key exchange schemes, which are widely in use today. As cryptographic algorithms are the foundation of secure internet communication, the development of Quantum Key Distribution (QKD) and Post-Quantum Cryptography (PQC) is essential to protect transactions over the internet. However, solutions like Quantum Key Distribution require heavy infrastructure. So, it is not feasible for the Internet of Things with fewer resources in computing power and form factor. Post-Quantum Cryptography is helpful on these devices. But, it needs further developments and improvements. This paper analyzes cryptography algorithms and protocols of IoT with different categories. Integrated PQC of National Institute of Standards and Technology (NIST) third level finalists on Raspberry Pi 4 (RPI4) board with Linux operating system. The performance of Post-Quantum Cryptography schemes for IoT has been evaluated. Finally, a Post-Quantum Cryptography scheme has been suggested for the Internet of Things based on the performance analysis.

Modular arithmetic plays very crucial role for public key cryptosystems, such as the public key cryptosystem, the key distribution scheme, and the key exchange scheme. Modular exponentiation is a common operation used by several public-key cryptosystems, such as the RSA encryption scheme and the Diffie-Hellman key exchange scheme. In this paper, we have proposed a new method to fast evaluate modular exponentiation, which combines the complement recoding method and canonical recoding technique.KeywordsCanonical recodingmodular arithmeticcomplexity analysesfast algorithm designpublic-key cryptosystem

Security is a significant problem for communications in many scenarios in Internet of Things (IoT), such as military applications, electronic payment, wireless reprogramming of smart devices and so on. To protect communications, a secret key shared by the communicating parties is often required. Authenticated key exchange (AKE) is one of the most widely used methods to provide two or more parties communicating over an open network with a shared secret key. It has been studied for many years. A large number of protocols are available by now. The majority of existing AKE protocols require the two communicating parties execute equivalent computational tasks. However, many communications take place between two devices with significantly different computational capabilities, such as a cloud center and a mobile terminal, a gateway and a sensor node, and so on. Most available AKE protocols do not perfectly match these scenarios. To further address the security problem in communications between parties with fairly unbalanced computational capabilities, this thesis studies AKE protocols with unbalanced computational requirements on the communicating parties. We firstly propose a method to unbalance computations in the Elliptic Curve Diffie-Hellman (ECDH) key exchange scheme. The resulting scheme is named as UECDH scheme. The method transfers one scalar multiplication from the computationally limited party to its more powerful communicating partner. It significantly reduces the computational burden on the limited party since scalar multiplication is the most time-consuming operation in the ECDH scheme. When applying the UECDH scheme to design AKE protocols, the biggest challenge is how to achieve authentication. Without authentication, two attacks (the man-in-the-middle attack and the impersonation attack) can be launched to the protocols. To achieve authentication, we introduce different measures that are suitable for a variety of use cases. Based on the authentication measures, we propose four suites of UECDH-based AKE protocols. The security of the protocols is discussed in detail. We also implement prototypes of these protocols and similar protocols in international standards including IEEE 802.15.6, Transport Layer Security (TLS) 1.3 and Bluetooth 5.0. Experiments are carried out to evaluate the performance. The results show that in the same experimental platform, the proposed protocols are more friendly to the party with limited computational capability, and have better performance than similar protocols in these international standards.

A secure and efficient AKE scheme for IoT devices using PUF and cancellable biometrics

This paper proposes authentication and key exchange scheme to communicate between users securely in small scale Wi-Fi networks. Depend on the Wi-Fi options, there can be various vulnerabilities in the network. Especially, most of small scale Wi-Fi networks have used the options which can cause several vulnerabilities. These Wi-Fi networks use passphrase for access authentication. However, these passphrases are known by the small network owner. In such circumstances, the network cannot assure security between users in the same network. In the existing Wi-Fi network, attackers in the same network can acquire pairwise keys by eavesdropping messages. Thus, this paper proposes the secure key exchange scheme to apply a public key cryptography. Using public key system, a station and an access point exchange a secondary key which user selects. This key is used for pairwise key generation. Through the proposed scheme, the network can protect users from several attacks in the same Wi-Fi network.

Password-based key exchange schemes are designed to provide entities communicating over a public network, and sharing a (short) password only, with a session key (e.g, the key is used for data integrity and/or confidentiality). The focus of the present paper is on the analysis of very efficient schemes that have been proposed to the IEEE P1363 Standard working group on password-based authenticated key-exchange methods, but which actual security was an open problem. We analyze the AuthA key exchange scheme and give a complete proof of its security. Our analysis shows that the AuthA protocol and its multiple modes of operations are provably secure under the computational Diffie-Hellman intractability assumption, in both the random-oracle and the ideal-ciphers models.

SummaryThrough the Industrial Internet of Things (IIoT), the manufacturing enterprises have significantly enhanced the production efficiency. The transmission of data in IIoT over public channels has brought about information leakage issues. Therefore, it is crucial to agree on a session key among the participants. In recent years, numerous authenticated key exchange (AKE) schemes have been designed. However, those AKE schemes which adopt the certificateless approach to tackle certificate management and key escrow may remain vulnerable to quantum attacks, and other AKE schemes which are based on lattice hard problem so as to achieve the post quantum security may incur key management issues. To simultaneously address the aforementioned challenges, we propose a lightweight certificateless lattice‐based authenticated key exchange (C2LAKE) scheme. Upon the hardness assumptions of the inhomogeneous small integer solution (ISIS) and computational bilateral inhomogeneous small integer solution (CBi‐ISIS) problems, the C2LAKE scheme has been demonstrated to be secure in the eCK model and the random oracle model (ROM). Better trade‐off among security and functionality features, and communication and computation costs make the C2LAKE scheme suitable and applicable in the IIoT environment.

Growth of civil air traffic worldwide and new entrants such as Unmanned Aeronautical Vehicles (UAVs) pose a great challenge for the supporting Communication, Navigation and Surveillance (CNS) infrastructure. Analogue systems have to be replaced by digital means to optimize spectrum efficiency and automation is becoming much more important to be able to handle the amount of participants in the air traffic system.
\nAs safety and security are strongly intertwined in aviation, cybersecurity is one key enabler for digitalization in civil aviation. However, few deployed digital aeronautical communications system. 
\nLink requirements of low latency and low bandwidth make certificate based trust solutions costly, due to the comparatively high load of security data exchanged in a certificate based authenticated key exchange scheme. Thus, this paper proposes an alternative by introducing the challenge-response based Physical Unclonable Function (PUF) Mutual Authentication Key Exchange (PMAKE) scheme. Additionally, it is shown how a Keyless Signature Infrastructure (KSI) can be incorporated into the PMAKE scheme to secure the challenge-response pairs and anchor trust in a distributed way into the system.

SUMMARYIn this paper, we first showed that Lou and Huang's three‐party password‐based key exchange protocol is still vulnerable to offline dictionary attacks. Thereafter, we proposed an enhanced protocol that can defeat the attack described and yet is efficient. Finally, we provided the rigorous proof of the security for it. Copyright © 2011 John Wiley & Sons, Ltd.

Supersingular Isogeny Diffie-Hellman (SIDH) is a key exchange scheme that is believed to be quantum-resistant. It is based on the difficulty of finding a certain isogeny between given elliptic curves. Over the last nine years, optimizations have been proposed that significantly increased the performance of its implementations. Today, SIDH is a promising candidate in the US National Institute for Standards and Technology’s (NIST’s) post-quantum cryptography standardization process. This work is a self-contained introduction to the active research on SIDH from a high-level, algorithmic lens. After an introduction to elliptic curves and SIDH itself, we describe the mathematical and algorithmic building blocks of the fastest known implementations. Regarding elliptic curves, we describe which algorithms, data structures and trade-offs regard- ing elliptic curve arithmetic and isogeny computations exist and quantify their runtime cost in field operations. These findings are then tailored to the situation of SIDH. As a result, we give efficient algorithms for the performance-critical parts of the protocol.