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

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 s...

Full description

Bibliographic Details
Main Authors: Majid Salimi, Hamid Mala, Honorio Martin, Pedro Peris-Lopez
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8950068/
_version_ 1818428183532273664
author Majid Salimi
Hamid Mala
Honorio Martin
Pedro Peris-Lopez
author_facet Majid Salimi
Hamid Mala
Honorio Martin
Pedro Peris-Lopez
author_sort Majid Salimi
collection DOAJ
description 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.
first_indexed 2024-12-14T14:57:34Z
format Article
id doaj.art-5647c55713ea41fa9a5c4349076599f5
institution Directory Open Access Journal
issn 2169-3536
language English
last_indexed 2024-12-14T14:57:34Z
publishDate 2020-01-01
publisher IEEE
record_format Article
series IEEE Access
spelling doaj.art-5647c55713ea41fa9a5c4349076599f52022-12-21T22:56:58ZengIEEEIEEE Access2169-35362020-01-0188821883310.1109/ACCESS.2020.29640388950068Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key ExchangeMajid Salimi0https://orcid.org/0000-0001-7475-7258Hamid Mala1https://orcid.org/0000-0002-7789-452XHonorio Martin2https://orcid.org/0000-0002-8720-406XPedro Peris-Lopez3https://orcid.org/0000-0001-6943-0760Faculty of Computer Engineering, University of Isfahan, Isfahan, IranFaculty of Computer Engineering, University of Isfahan, Isfahan, IranDepartment of Electronic Technology, University Carlos III of Madrid, Leganés, SpainDepartment of Computer Science, University Carlos III of Madrid, Leganés, SpainMulti-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.https://ieeexplore.ieee.org/document/8950068/Multi-party non-interactive key exchangebroadcast encryptionInternet of Thingsrandom oracle model
spellingShingle Majid Salimi
Hamid Mala
Honorio Martin
Pedro Peris-Lopez
Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange
IEEE Access
Multi-party non-interactive key exchange
broadcast encryption
Internet of Things
random oracle model
title Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange
title_full Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange
title_fullStr Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange
title_full_unstemmed Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange
title_short Full-Resilient Memory-Optimum Multi-Party Non-Interactive Key Exchange
title_sort full resilient memory optimum multi party non interactive key exchange
topic Multi-party non-interactive key exchange
broadcast encryption
Internet of Things
random oracle model
url https://ieeexplore.ieee.org/document/8950068/
work_keys_str_mv AT majidsalimi fullresilientmemoryoptimummultipartynoninteractivekeyexchange
AT hamidmala fullresilientmemoryoptimummultipartynoninteractivekeyexchange
AT honoriomartin fullresilientmemoryoptimummultipartynoninteractivekeyexchange
AT pedroperislopez fullresilientmemoryoptimummultipartynoninteractivekeyexchange