Skip navigation

Efficient and flexible multi-authority attribute-based authentication for IoT devices

Efficient and flexible multi-authority attribute-based authentication for IoT devices

Su, Ye ORCID: 0000-0002-4912-3197 , Zhang, Xi, Qin, Jing ORCID: 0000-0003-2380-0396 and Ma, Jixin ORCID: 0000-0001-7458-7412 (2023) Efficient and flexible multi-authority attribute-based authentication for IoT devices. IEEE Internet of Things Journal. p. 1. ISSN 2327-4662 (Online) (doi:https://doi.org/10.1109/JIOT.2023.3263497)

[img]
Preview
PDF (Publisher VoR)
41485_MA_Efficient_and_flexible_multi_authority_attribute_based_authentication_for_IoT_devices.pdf - Accepted Version

Download (2MB) | Preview

Abstract

The correctness and reliability of data sources are the keys to the practicality of data collected by IoT devices. Attribute-based signature(ABS) is a cryptographic primitive for users to sign with their own attributes, which can be applied to the authentication process in IoT scenarios. The attribute authority is responsible for issuing the attribute key to the user in ABS. Multiple authorities can complete attribute management tasks to avoid the threat of a single authority. However, attribute authorities need to execute multiple interactions to collaborate to generate attribute keys for users, which brings a large transmission burden. In addition, a lot of resource-constrained terminals in the IoT mostly play the role of signer or verifier in authentication protocols. The signature generation and verification algorithms often have heavy pairing and exponentiation operations. Currently, no ABS scheme takes into account the efficiency of all participating entities simultaneously. In this paper, we present an aggregated anonymous key issue (AAKI) protocol to reduce the transmission burden between multiple authorities. Meanwhile, the non-interactive zero-knowledge proof aggregate exponentiation (NI-ZKPoKAE) protocol is designed to aggregate the transmitted secret values in AAKI. To reduce the computational burden of signers and verifiers, Blakley secret sharing, where the Hadamard matrix is used more efficiently to handle the (n,n)-threshold, is used to construct an efficient and fine-grained multi-authority ABS (EFMA-ABS) scheme. This brings high efficiency to all three types of parties involved in IoT authentication. Our above-mentioned protocols have been proven to be feasible and effective.

Item Type: Article
Uncontrolled Keywords: attribute-based signature; multi-authority; IoT authentication; proof of knowledge; aggregated anonymous key issue; Blakley secret sharing
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Faculty / School / Research Centre / Research Group: Faculty of Engineering & Science
Faculty of Engineering & Science > School of Computing & Mathematical Sciences (CMS)
Related URLs:
Last Modified: 30 Jun 2023 10:10
URI: http://gala.gre.ac.uk/id/eprint/41485

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics