An over-the-air key establishment protocol using keyless cryptography

Zhang, Yuexin; Xiang, Yang; Wang, Tao; Wu, Wei; Shen, Jian

doi:10.1016/j.future.2016.12.013

Cited by 15 publications

(5 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A key ingredient of our solution is transmission anonymity, also known as source indistinguishably [8]- [11]. At each round, both A and B should guarantee that their transmission is anonymous, i.e., the probability of E to guess the actual transmitter should not be higher than a random guess.…”

Section: A Transmission Anonymitymentioning

confidence: 99%

See 1 more Smart Citation

KaFHCa: Key-establishment via Frequency Hopping Collisions

Usman¹,

Raponi²,

Qaraqe³

et al. 2020

Preprint

View full text Add to dashboard Cite

The massive deployment of IoT devices being utilized by home automation, industrial and military scenarios demands for high security and privacy standards to be achieved through innovative solutions. This paper proposes KaFHCa, a crypto-less protocol that generates shared secret keys by combining random frequency hopping collisions and source indistinguishability independently of the radio channel status. While other solutions tie the secret bit rate generation to the current radio channel conditions, thus becoming unpractical in static environments, KaFHCa guarantees almost the same secret bit rate independently of the channel conditions. KaFHCa generates shared secrets through random collisions of the transmitter and the receiver in the radio spectrum, and leverages on the fading phenomena to achieve source indistinguishability, thus preventing unauthorized eavesdroppers from inferring the key. The proposed solution is (almost) independent of the adversary position, works under the conservative assumption of channel fading (σ = 8dB), and is capable of generating a secret key of 128 bits with less than 564 transmissions.

show abstract

Section: A Transmission Anonymitymentioning

confidence: 99%

“…Another solution exploiting source indistinguishability is provided in [11]. Nevertheless, their solution requires preliminary phases, i.e., initialization, training, and signal transmission, which introduces delay in the overall protocol.…”

Section: Introductionmentioning

confidence: 99%

KaFHCa: Key-establishment via Frequency Hopping Collisions

Usman¹,

Raponi²,

Qaraqe³

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

“…2) Key Establishment using Keyless Cryptography Technology: Alpern and Schneider designed a key-establishment protocol in [179] using keyless cryptography technology, and it was improved by [180]- [182]. In these protocols, the characteristics of the anonymous channel are utilized to establish secret keys.…”

Section: A Lightweight Authenticationmentioning

confidence: 99%

“…Completing the above operations, two vehicles (say Alice and Bob) can establish a secret key with |k | bits. To assess the efficiency of keyless cryptography, an analysis in [182] was conducted and keyless cryptography was compared with Diffie-Hellman key exchange protocol (as a well-known asymmetric cryptography approach) in terms of energy and time consumption. The most interesting finding was that, using IEEE 802.15.4 CSMA/CA medium access control (MAC) protocol, keyless cryptography uses 159 times less energy than Diffie-Hellman protocol.…”

Section: A Lightweight Authenticationmentioning

confidence: 99%

An Overview of Attacks and Defences on Intelligent Connected Vehicles

Dibaei,

Zheng,

Jiang

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

Cyber security is one of the most significant challenges in connected vehicular systems and connected vehicles are prone to different cybersecurity attacks that endanger passengers' safety. Cyber security in intelligent connected vehicles is composed of in-vehicle security and security of inter-vehicle communications. Security of Electronic Control Units (ECUs) and the Control Area Network (CAN) bus are the most significant parts of in-vehicle security. Besides, with the development of 4G LTE and 5G remote communication technologies for vehicle-toeverything (V2X) communications, the security of inter-vehicle communications is another potential problem. After giving a short introduction to the architecture of next-generation vehicles including driverless and intelligent vehicles, this review paper identifies a few major security attacks on the intelligent connected vehicles. Based on these attacks, we provide a comprehensive survey of available defences against these attacks and classify them into four categories, i.e. cryptography, network security, software vulnerability detection, and malware detection. We also explore the future directions for preventing attacks on intelligent vehicle systems.

show abstract

“…Suppose we have a set of n nodes. In its general form, called the multi-party scenario, the key distribution problem is not restricted to only pairs of users, but it must enable any arbitrary subset of these n nodes to determine a shared key [2]. A trivial solution to this problem is that a Trusted Authority (TA) generates M = 2 n − n − 1 symmetric keys, and assigns each to one of the M subsets with at least two members.…”

Section: Introductionmentioning

confidence: 99%

Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange

et al. 2020

View full text Add to dashboard Cite

Multi-Party Non-Interactive Key Exchange (MP-NIKE) is a fundamental cryptographic primitive in which users register into a key generation centre and receive a public/private key pair each. After that, any subset of these users can compute a shared key without any interaction. Nowadays, IoT devices suffer from a high number and large size of messages exchanged in the Key Management Protocol (KMP). To overcome this, an MP-NIKE scheme can eliminate the airtime and latency of messages transferred between IoT devices. MP-NIKE schemes can be realized by using multilinear maps. There are several attempts for constructing multilinear maps based on indistinguishable obfuscation, lattices and the Chinese Remainder Theorem (CRT). Nevertheless, these schemes are inefficient in terms of computation cost and memory overhead. Besides, several attacks have been recently reported against CRT-based and lattice-based multilinear maps. There is only one modular exponentiation-based MP-NIKE scheme in the literature which has been claimed to be both secure and efficient. In this article, we present an attack on this scheme based on the Euclidean algorithm, in which two colluding users can obtain the shared key of any arbitrary subgroup of users. We also propose an efficient and secure MP-NIKE scheme. We show how our proposal is secure in the random oracle model assuming the hardness of the root extraction modulo a composite number. INDEX TERMS Multi-party non-interactive key exchange, broadcast encryption, Internet of Things, random oracle model.

show abstract

An over-the-air key establishment protocol using keyless cryptography

Cited by 15 publications

References 12 publications

KaFHCa: Key-establishment via Frequency Hopping Collisions

KaFHCa: Key-establishment via Frequency Hopping Collisions

An Overview of Attacks and Defences on Intelligent Connected Vehicles

Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange

Contact Info

Product

Resources

About