You are currently viewing a new version of our website. To view the old version click .
Sensors
  • Article
  • Open Access

22 January 2025

Robust Access Control for Secure IoT Outsourcing with Leakage Resilience

Computer Science Department, College of Computer Sciences & Information Technology, King Faisal University, Al-Ahsa 31982, Saudi Arabia
This article belongs to the Special Issue Advancements and Challenges in IoT Communication Technologies for a Connected World

Abstract

The Internet of Things (IoT) has revolutionized various industries by enabling seamless connectivity and data exchange among devices. However, the security and privacy of outsourced IoT data remain critical challenges, especially given the resource constraints of IoT devices. This paper proposes a robust and leakage-resilient access control scheme based on Attribute-Based Encryption (ABE) with partial decryption outsourcing. The proposed scheme minimizes computational overhead on IoT devices by offloading intensive decryption tasks to the cloud, while ensuring resilience against master secret key leakage, side-channel attacks, and other common security threats. Comprehensive security analysis demonstrates the scheme’s robustness under standard cryptographic assumptions, and performance evaluations show significant improvements in decryption efficiency, scalability, and computational performance compared to existing solutions. The proposed scheme offers a scalable, efficient, and secure access control framework, making it highly suitable for real-world IoT deployments across domains such as smart healthcare, industrial IoT, and smart cities.

1. Introduction

The Internet of Things (IoT) is a network consisting of various intelligent devices and gadgets, including sensors, smartphones, and RFID tags [1]. The IoT has the potential to have a positive impact on our daily lives through applications such as smart city development, smart grid technologies, and advancements in healthcare services using intelligent medical devices [2]. In addition to providing convenience, the IoT has also stimulated its own advancement by enabling smart devices to monitor, collect, transmit, store, and share data within the IoT network. However, the increased connectivity and data sharing in IoT environments has raised significant security and privacy concerns [3]. IoT devices suffer from limited resources, which are represented in limited computational power and battery life. Consequently, traditional security mechanisms may not be directly applicable or efficient in IoT settings. Researchers have proposed various access control schemes for managing and securing IoT data [4,5]. Existing access control methods, such as lightweight encryption and cryptography algorithms, perform data evaluation on IoT devices, leading to security threats and efficiency issues.
As a result of the relevance and level of sensitivity of the IoT, information that is to be outsourced on untrusted cloud web servers requires effective access control in order to secure the information before it is outsourced [6]. In an open network environment, it is necessary to prevent unauthorized entities from accessing the information [7,8]. One of the primary access control methods for IoT is to leverage cryptographic techniques such as encryption and access control policies to protect the data. However, the limited computing and storage capabilities of IoT devices pose challenges in implementing robust and efficient access management protocols [9]. For IoT data, the sheer amount of data received from the IoT devices poses some challenges. Outsourcing data storage and processing to cloud or fog computing platforms has become an interesting solution to address the resource constraints of IoT devices [6]. However, the outsourcing of data and access control mechanisms introduces new security and privacy concerns, as data and access control policies are now managed by third-party service providers [10]. To address this issue, researchers have proposed the concept of secure outsourcing access control, where computationally intensive tasks are offloaded to more powerful cloud or fog computing entities, while IoT devices retain control over the data access [11].
When it comes to controlling data access, attribute encryption is a highly suitable choice. The innovation of attribute-based encryption determines whether the access should be granted or denied based on whether the users’ attributes fulfill the access control framework [12]. Consequently, there is now less reliance on cloud providers for handling data access control. Thus, this paper introduces a new form of secure IoT data outsourcing with resilient protection against leakage [13]. Attribute-Based Encryption (ABE) techniques have been extensively studied for secure data sharing in IoT. However, these schemes do not adequately address the issue of potential leakage of sensitive information when access control mechanisms are outsourced [14].
When initially considering cryptographic access control, the well-known Ciphertext Policy Attribute-Based Encryption (CP-ABE) method is often mentioned. However, ABE itself involves significant computational costs, particularly during decryption. To improve security performance in this phase, offline/online technology may be utilized [15]. Moreover, ABE schemes producing ciphertexts of constant size can help alleviate communication overhead, but they are not suitable for IoT terminals due to resource constraints [16]. Additionally, in an IoT environment where numerous terminals are deployed across distributed settings, several security issues such as side-channel attacks may arise when attackers gain access to the system’s master private keys [17]. If these keys are compromised, the entire system will lose its security integrity, and data privacy and safety within the system would face serious threats [18,19].

1.1. Motivation

The rapid proliferation of IoT devices has revolutionized multiple sectors, including healthcare, smart cities, and industrial automation. However, this growth has also introduced substantial challenges in managing the security and privacy of outsourced data, particularly when leveraging cloud and fog computing platforms for storage and processing. Traditional access control schemes, such as CP-ABE, offer fine-grained access control but suffer from computational overhead, scalability issues, and susceptibility to master key leakage. Furthermore, existing approaches often neglect the potential information leakage during outsourced computations, especially when sensitive access policies and cryptographic keys are managed by third-party servers. This oversight creates significant vulnerabilities in real-world IoT deployments, where resource-constrained devices cannot perform intensive cryptographic computations locally.
Recent advancements have focused on improving secure communication and data handling frameworks for distributed systems. For example, techniques explored in [20,21] provide innovative solutions for secure and efficient communication in dynamic environments. However, these works primarily address communication efficiency and sensor integration rather than fine-grained access control and resilience to key leakage. My proposed scheme builds on these foundations by introducing a leakage-resilient access control mechanism that offloads intensive computations to cloud servers while preserving the confidentiality of access policies and data. Unlike existing schemes, my approach integrates mechanisms for protecting against master secret key leakage and optimizes performance through partial decryption outsourcing. This ensures that even in resource-constrained environments, IoT devices can securely manage outsourced computations without sacrificing efficiency or scalability.
By addressing these critical gaps, my proposed access control model not only enhances the security of outsourced IoT data but also provides a scalable and computationally efficient framework that aligns with modern IoT security requirements.

1.2. Contributions

The main contributions in this paper are summarized as follows:
  • This paper introduces a secure outsourcing access control model with leakage resilience to be used in the IoT environment, which takes advantage of attribute-based encryption in the access control.
  • This paper designs efficient mechanisms to protect the access control scheme against potential information leakage when data and access policies are outsourced to third-party cloud or fog computing providers.
  • This paper optimizes the computational and communication overheads of the access control scheme to accommodate the resource-constrained IoT devices by leveraging techniques such as offline/online encryption and decryption outsourcing.
Finally, comprehensive pilot evaluation of a variety of configurations confirmed the effectiveness and efficiency of the proposed access control system.

1.3. Acronyms and Notations

To facilitate understanding of the technical content, this paper provides a summary of the acronyms and notations used throughout this paper. Nomenclature and Abbreviations lists the key acronyms and notations, along with their respective descriptions. These definitions will help readers navigate the proposed scheme and its associated terminology with ease.

1.4. Organization

The remaining part of this paper is structured as follows: Section 3 introduces the system model and security requirements. Section 2 presents an overview of related studies and provides a comprehensive comparison between the CP-ABE schemes currently proposed and my access control solution. Section 4 outlines the fundamental preliminaries and notations that were taken into account during the development of my access control method. Section 5 explains the general description of my proposed model and the security model. In Section 6, this paper details the construction process for the proposed multidimensional access control scheme, including its five compatible algorithms. The security analysis and proofs are introduced in Section 7. An examination of the performance of the proposed scheme has been presented in Section 8. Finally, the paper summary is provided in Section 9.

3. System Model and Security Requirements

In this section, the detailed system model is presented, clearly defining the roles and responsibilities of each entity in the architecture to ensure clarity and coherence.

3.1. System Architecture

The proposed access control scheme operates within a cloud-assisted IoT system that consists of four primary entities, each with distinct responsibilities, as shown in Figure 1:
Figure 1. The system model showing the detailed communication steps among the four primary entities (Attribute Authority, Cloud Service Provider, IoT Devices, and IoT Users).
  • Attribute Authority ( A A )
    • The A A is a trusted entity responsible for managing and distributing cryptographic keys and user attributes.
    • It generates the Master Secret Key ( M S K ), Public Parameter ( P P s ), user-specific Secret Keys ( S K s ), and Transformation Keys ( T K s ).
    • The A A ensures that the attributes assigned to each user align with their access privileges.
    • Security Role: Ensures attribute integrity and prevents unauthorized attribute assignment.
  • Cloud Service Provider ( C S P )
    • The C S P provides storage and computational resources for encrypted IoT data.
    • It handles ciphertext storage and performs partial decryption operations on behalf of IoT devices using T K .
    • Security Role: Operates as an honest-but-curious entity, meaning it follows protocol specifications but may attempt to infer information from stored or processed data.
  • IoT Devices
    • IoT devices (e.g., sensors, actuators, and smart cameras) collect and generate sensitive data.
    • Due to limited computational power and energy constraints, IoT devices outsource intensive cryptographic computations to the C S P .
    • Security Role: Encrypt data before transmission, ensuring that sensitive information remains secure during storage and processing.
  • IoT Users
    • IoT users are authorized individuals or systems that need access to specific IoT data.
    • They possess user-specific S K s issued by the Attribute Authority.
    • Users download partially decrypted ciphertext from the C S P and perform final decryption locally to retrieve plaintext data.
    • Security Role: Ensure private key confidentiality and verify the correctness of decryption results.

3.2. Workflow Overview

The overall workflow of the proposed system can be summarized in the following key steps:
  • System Initialization:
    • The A A generates ( P P s ) and the ( M S K ), which are distributed appropriately.
  • Key Generation:
    • The A A generates user-specific S K s and T K s based on their attribute sets.
  • Data Encryption:
    • IoT devices encrypt collected data using P P s and predefined access policies.
    • Encrypted data (ciphertext) are then uploaded to the C S P for storage.
  • Partial Decryption by the C S P :
    • Upon receiving a decryption request, the C S P uses the T K s associated with the user to perform partial decryption and generates a Partial Ciphertext ( P T ).
  • Final Decryption by IoT User:
    • The IoT user downloads the P T and applies their S K s to retrieve the plaintext message.

3.3. Security Assumptions

  • Trusted Attribute Authority: The A A is considered fully trusted and will not deviate from protocol specifications.
  • Honest-but-Curious CSP: The C S P follows the protocol honestly but may attempt to infer sensitive information from stored ciphertexts and access policies.
  • Secure Communication Channels: All communication between entities (e.g., IoT devices, C S P , A A , and IoT users) occurs over secure communication channels protected by standard encryption protocols (e.g., TLS).
  • Device Integrity: IoT devices are assumed to be secure against unauthorized access, though side-channel attack resilience is implemented as an added layer of security.

3.4. Security Goals

The proposed access control scheme should satisfy the following security requirements:
  • Fine-grained Access Control: The scheme should support flexible and fine-grained access control, where access policies can be defined based on multiple attributes of IoT users.
  • Leakage Resilience: The scheme should be resilient against potential information leakage when the access control data and policies are outsourced to the cloud service provider.
  • Efficiency: The scheme should be computationally efficient for resource-constrained IoT devices by offloading the heavyweight cryptographic operations to the cloud service provider.
  • Verifiability: The IoT users should be able to verify the correctness of the decryption results returned by the cloud service provider.

3.5. Technical Challenges

To achieve the above security requirements, the proposed access control scheme needs to address the following technical challenges:
  • Designing a fine-grained attribute-based access control mechanism that can be efficiently outsourced to the cloud.
  • Incorporating leakage-resilient techniques to secure the access control data confidentiality and policies when they are outsourced.
  • Reducing the computational and communication overheads of the access control scheme to accommodate the resource-constrained IoT devices.
  • Ensuring the verifiability of the decryption results returned by the cloud service provider.

4. Scheme Preliminaries

In this section, the basic knowledge and assumptions are introduced on which this paper relies on to construct the proposed new access control:
  • Composite order Bilinear Groups
    The first composite order bilinear groups were introduced by Dan et al. [54]. This scheme randomly selects groups of N = p 1 p 2 p 3 order with different prime numbers p 1 , p 2 , and p 3 . Let G express the composite order group. Let G 1 , G 2 , and G 3 express the three subgroups with order p 1 , p 2 , and p 3 , respectively. The bilinear map with computable non-degenerate G × G G T is characterized by the following properties:
    Non-degenetate: g G e ( g , g ) 1 G T
    Bilinear: x , y Z N e ( g x , g y ) = e ( g , g ) x y
    To see this, if g generates G, g p 1 p 2 belongs to G 3 , g p 1 p 3 belongs to G 2 , and g p 2 p 3 belongs to G 1 . a G 1 , and b G 2 , e ( a , b ) = 1 G T .
  • Vector Notation
    Choose G. Then, u 1 , u 2 G n is defined as follows:
    e n ( u 1 , u 2 ) = i = 1 n e ( u 1 i , u 2 i ) G T .
    where u 1 = < u 11 , u 12 , , u 1 n > and u 2 = < u 21 , u 22 , , u 2 n >
Definition 1
(Discrete Logarithm Problem (DLP)). Here is the finite field Z p generated by the generator g. Select a group number h Z p , and find an group element a Z p such that g a = h whenever such integer exist.

5. Model Definition and Security Model

5.1. Model Definition

The proposed scheme is the extension of the Lewko scheme [55]. In the scheme, the decryption stage needs a lot of computation. The proposed scheme outsources the calculation in the decryption phase:
  • I n i ( 1 λ , U ) ( P P , M S K ) : This algorithm accepts λ (security parameter) as input and generates the P P s (public parameters) and the M S K (master secret key) as output.
  • K e y G e n ( M S K , S ) ( S K , T K ) : It accepts S U and the M S K as inputs. It then generates the S K S (secret key) of the user and the transformation key T K .
  • E n c ( P K , ( A , ρ ) , M ) C T : This algorithm accepts the P K , the access structure ( A , ρ ) and the message M as inputs and then generates the ciphertext C T .
  • D a t a d e c r y p t i o n : The decryption algorithm contains the partial decryption algorithm on the cloud server and the decryption algorithm on the client side.
    D e c o u t ( T K , C T ) P T : The algorithm accepts C T , which is associated with the ( A , ρ ) and the transformation key T K as inputs, and then outputs the partial ciphertext P T .
    D e c ( P T , S K ) m : The algorithm inputs the partial ciphertext P T and the user’s private key S K and outputs the message M.

5.2. Security Model

In this section, the scheme’s security has been defined through the game between A and B:
  • Setup: The B process the I n i ( 1 λ , U ) ( P P , M S K ) to obtain the P K and the M S K . Then, the P K will be sent to the adversary A. The challenger also initializes an empty set D, where D 2 U , and an empty table T, where T I × 2 U × S K × T K (I represents a handle counter and T K represents the transformation key).
  • Phase 1: A can repeat the upcoming inquiries to B.
    C r e a t e ( S ) : A submits an attribute S to B to obtain the transformation key T K . B calls the K e y G e n ( M S K , S ) ( S K , T K ) to obtain the S K and the T K . B sets i : = i + 1 and stores the entry ( I , S , S K , T K ) in T. Finally, T K is returned to the adversary.
    C o r r u p t ( I ) : When the ith exists in the table T, B can obtain the entry ( I , S , S K , T K ) , and return S K to A. When no such entry exists, the algorithm will be terminated. Finally, B sets D : = D S .
  • Challenge: A sends a challenge access structure A , where the attribute set S in T is not satisfied with it, and two messages M 0 , M 1 with the equal length to the challenger. The challenger randomly selects the two messages M 0 , M 1 under A to encrypt; it then sends C T to A.
  • Phase 2: It is the same phase 1 with the following restriction:
    The attribute set whose private key will be asked is not satisfied with A .
    A unable to request for decrypting of M 0 and M 1 .
  • Guess: The adversary outputs his guess b .
In this game, the advantage of the adversary is defined as
A d v A : = P r | b = b | 1 2 .

6. Scheme Construction

The concrete scheme with outsourcing decryption and anti-master secret key leakage is as follows:

6.1. System Setup

I n i ( 1 λ , U ) ( P P , M S K ) : This algorithm first selects a group of composite order N = p 1 p 2 p 3 . Then, it randomly chooses the α , a Z N and g 1 which belong to G 1 . Let U represent attributes. The algorithm selects random s i Z N , i U and n, where x 1 , x 2 , , x n Z N . The algorithm also chooses t , y 1 , y 2 , , y n Z N and ρ Z N n + 1 , ρ n + 2 Z N , i U ρ i Z N from the subgroup G 3 .
Finally, The algorithm outputs P P : P K = ( N , g 1 , g 3 , g 1 a , e ( g 1 , g 1 ) α , g 1 x 1 , g 2 x 2 , , g 1 x n , i U T i = g 1 s i ) .
The master secret key M S K is as follows:
M S K = ( U , K 1 , L , i U K i ) = ( U , < g 1 y 1 , g 1 y 2 , , g 1 y n , g 1 α g 1 a t i = 1 n g 1 x i y i > · g 3 ρ , g 1 t g 3 ρ n + 2 , i S T i t g 3 ρ i ) .

6.2. Key Generation

K e y G e n ( M S K , S ) ( S K , T K ) : It accepts an attribute set S U and M S K . Then, it generates the S K and the T K . The algorithm randomly selects values t , z , z 1 , z 2 , , z n Z N . The T K is then represented as follows:
T K = ( S , K 1 z , L z , i S K i z )
where
K 1 = K 1 · < g 1 z 1 , g 1 z 2 , , g 1 z n , g 1 a t i = 1 n g 1 x i z i > · g 3 ρ ,
L = L g 1 t g 3 ρ n + 2 ,
K i = K i T i t g 3 ρ
The S K is represented as follows:
S K s = z 1 m o d p

6.3. Data Encryption

E n c ( P K , ( A , ρ ) , M ) C T : This algorithm inputs the public key P K , an access structure ( A , ρ ) , where A is a l × n matrix, and ρ is a mapping ρ ( x ) U from rows of matrix to the attributes and a message M. It outputs the final ciphertext. It randomly chooses v = < s , v 2 , , v n > Z N n and generates λ i = v · A i . It also selects r x Z N for A x . Then, it randomly chooses r i for i [ 1 , , l ] and calculates C i . The algorithm generates the partial C T .
C T = ( C 0 , C 1 , { C i , D i } i S )
as:
C 0 = M ( e ( g 1 , g 1 ) α ) s ,
C 1 = < ( g 1 x 1 ) s , ( g 1 x 2 ) s , , ( g 1 x n ) s , g s > ,
i C i = g a λ i T i r i ,
i D i = g 1 r i
Finally, the C T is represented as
C T = ( C 0 , C 1 , { C i , D i } i S )

6.4. Data Decryption

The decryption algorithm contains the partial decryption algorithm on the cloud server and the decryption algorithm on the client side.
D e c o u t ( T K , C T ) P T : The algorithm inputs the ciphertext C T associated with the access structure ( A , ρ ) and the transformation key T K and then outputs the partial ciphertext P T . It is a polynomial time to find a set i [ 1 , , l ] ω i λ i = s . This algorithm calculates the outsourced decryption ciphertext P T as
P T = e n + 1 ( C 1 , K 1 z ) ρ ( x ) S ( e ( C x , L z ) e ( D x , K x z ) ) ω i = e ( g 1 , g 1 ) α s z
The partial operations of the above equation are as follows:
e n + 1 ( C 1 , K 1 z ) = e ( C 1 , K 1 z ) · e ( C 1 , ( g 1 z 1 , g 1 z 2 , , g 1 z n , g 1 a t i = 1 n g 1 x i z i ) ) = e ( g 1 , g 1 ) α s z e ( g 1 , g 1 ) a s z t e ( g 1 , g 1 ) a s z t · e ( C x , L z ) e ( D x , K x z ) = e ( C 1 , L ) z e ( C 1 , g 1 t g 3 ρ n + 2 ) z e ( D x , k i ) z e ( D x , T i g 3 ρ ) z = e ( g 1 , g 1 ) a z λ i t e ( g 1 , g 1 ) a z t λ i
If the attribute sets satisfy the access control policy, it will be able to decrypt correctly. Otherwise, it will not obtain the correct plaintext in the next step.
D e c ( P T , S K ) m : The algorithm inputs the partial ciphertext P T and the user’s private key S K S and outputs the message M.
m = C 0 P T S K S

7. Security Analysis

In this section, the in-depth security analysis of the proposed access control scheme is presented, focusing on its resilience against various potential attack vectors, including unbreakable DLP, side-channel attacks, master secret key leakage, and other known cryptographic vulnerabilities.

7.1. Unbreakable DLP

Theorem 1.
Attackers cannot break the proposed system in polynomial time under the DLP.
Proof. 
The proposed scheme is an extension of the Lewko scheme [55], which is denoted by L = ( S e t u p L , K e y g e n L , E n c r y p t L , D e c r y p t L ) . The scheme L is ( l M S K , l S K ) master–leakage secure. The adversary cannot break it in polynomial time. If the adversary can break the DLP, the adversary can break the proposed scheme = ( I n i , K e y g e n , E n c r y p t , D e c r y p t o u t , d e c r y p t ) in polynomial time. The stimulator B will interact with the challenger C of the Lewko scheme and the adversary A. □
Setup: It is easy to find that the system parameters of the proposed scheme in initialization stage are the same as those of the Lewko’s scheme. So, the stimulator B asks the challenger C of the scheme [55] about the system parameters. C returns the P K to B. Then, B sends it to A.
Phase 1: At this stage, when A sends S to B to obtain S K S , B will send S to C and obtain the S K S . The stimulator B selects a value z Z N randomly and computers K 1 z , L z , i S K i z . Let z 1 be the private key. The T K is represented as T K = ( S , K 1 z , L z , i S K i z ) . After that, it stores the entry ( I , S , S K , T K ) in table T and returns the transformation key T K and S K to the adversary A.
Challenge Phase: The adversary A sends to the B the messages M 0 , M 1 and the A . B selects b { 0 , 1 } . B sends M b and A to the challenger C. The challenger C returns the ciphertext C T = ( C 0 , C 1 , { C i , D i } i S ) . B sends C T to A as the challenge ciphertext C T .
Phase 2: This phase is the same as Phase 1 with restriction that the attribute set of which private key will be asked is not satisfied with A . The adversary is unable to request to decrypt M 0 and M 1
Guess: The adversary outputs his guess b .
If the adversary A has a probability advantage that cannot be ignored in this game, adversaries will solve the DLP. In other words, attackers cannot break the proposed system in polynomial time under the DLP.

7.2. Resilience Against Side-Channel Attacks

Side-channel attacks exploit physical information leakage during cryptographic operations, such as power consumption, electromagnetic emissions, or timing analysis, to deduce sensitive information like encryption keys or intermediate computation states. These attacks pose a significant threat to resource-constrained IoT devices, where operations are often conducted on limited hardware with fewer defenses against side-channel analysis. The proposed scheme incorporates several strategies to mitigate the risk of side-channel attacks:
  • Outsourced Decryption: The most computationally expensive cryptographic operations, including bilinear pairing and modular exponentiation, are offloaded to cloud servers. This significantly reduces the number of resource-intensive computations performed on IoT devices, thereby minimizing the attack surface for side-channel adversaries.
  • Constant-Time Algorithms: The cryptographic algorithms used in the proposed scheme have been implemented in a constant-time manner, ensuring that execution time does not vary with input values. This eliminates timing-based side-channel vulnerabilities.
  • Transformation Key Isolation: The transformation key, used during the outsourced decryption phase, ensures that sensitive intermediate results are not exposed directly to the IoT device. Even if partial information is leaked from the IoT device, the master secret key remains secure, and the plaintext cannot be reconstructed without the transformation key and private key.
  • Randomization of Intermediate States: During the key generation and decryption phases, random noise is added to the intermediate computation states, making it infeasible for adversaries to deduce meaningful patterns from observed emissions or power traces.
Proof of Security Against Side-Channel Attacks: Assume an adversary A attempts to extract secret information through side-channel analysis during decryption. Since the most vulnerable cryptographic operations are performed on the cloud server rather than the IoT device, the adversary’s view is limited to observing lightweight operations such as final partial decryption. Furthermore, randomized intermediate states and constant-time execution ensure that no meaningful side-channel information can be extracted during local computations. As such, the adversary cannot derive the master secret key or plaintext solely through side-channel information, even if they have physical access to the IoT device.

7.3. Resilience Against Master Secret Key Leakage

The proposed scheme integrates anti-leakage techniques by leveraging composite order groups and key splitting mechanisms. Even if partial information about the master secret key is exposed, the attacker cannot reconstruct the full key without access to additional secure components distributed across different domains. This multilayered key protection mechanism ensures the confidentiality and integrity of the access control system even under master key exposure.

7.4. Resistance to Collusion Attacks

Collusion attacks occur when multiple unauthorized users pool their attribute keys to gain illegitimate access to encrypted data. The proposed scheme prevents such attacks by assigning unique transformation and private keys to each user based on their specific attribute set. Even if multiple users collude and combine their attribute keys, they cannot bypass the access policy or reconstruct the plaintext without satisfying the defined access structure.

7.5. Resistance to Replay Attacks

Replay attacks involve an adversary that reuses previously intercepted messages to gain unauthorized access. In the proposed scheme, ciphertexts are tied to unique access policies and transformation keys, rendering intercepted ciphertexts useless in future sessions. The scheme also uses randomization during encryption to ensure that each ciphertext is unique, even for identical plaintext.
Finally, the proposed access control scheme demonstrates robust security properties against a wide range of attack vectors, including side-channel attacks, master secret key leakage, collusion attacks, and replay attacks. By offloading resource-intensive cryptographic operations to cloud servers, incorporating randomization techniques, and employing constant-time algorithms, the proposed scheme significantly reduces vulnerabilities in resource-constrained IoT devices. Furthermore, reliance on established cryptographic hardness assumptions ensures resilience against traditional and quantum cryptographic attacks. This comprehensive analysis confirms the effectiveness of the proposed scheme in maintaining data confidentiality, access control integrity, and operational security in IoT environments.

8. Performance Analysis

In this section, the comprehensive performance evaluation of the proposed access control scheme has been presented, comparing it with multiple existing state-of-the-art schemes, including the Lewko et al. [55] scheme, Chase et al. [56]’s multiauthority ABE scheme, and Zhang et al. [57] constant-size ciphertext ABE scheme. The evaluation focuses on key performance metrics, including encryption time, decryption time, ciphertext size, and computational overhead on IoT devices.

8.1. Evaluation Metrics

  • Encryption Time: Measures the time required to encrypt a plaintext message under an attribute-based access policy.
  • Decryption Time: Measures the time taken to decrypt ciphertext and retrieve plaintext, including both partial decryption (outsourced to C S P ) and final decryption (on IoT users’ side).
  • Ciphertext Size: Represents the size of the encrypted data, directly impacting communication overhead.
  • Computational Overhead: Evaluates the computational burden on IoT devices, which is critical given their resource constraints.
  • Scalability: Assesses the performance impact when the number of attributes and users increases.

8.2. Comparative Analysis

The comparative results shown in Table 1 indicate the following:
Table 1. The detailed comparative analysis for the proposed scheme with three others schemes.
  • Decryption Time: The proposed scheme significantly reduced decryption time on IoT devices by outsourcing the most computationally intensive operations to the cloud server. In contrast, Lewko et al.’s scheme imposed a high computational burden on IoT devices during decryption.
  • Ciphertext Size: Zhang et al.’s scheme achieved constant ciphertext size, which minimized communication overhead. However, it came at the cost of higher complexity in encryption. The proposed scheme maintained a good balance between compact ciphertexts and efficient encryption.
  • Computational Overhead: Both the proposed scheme and Zhang et al.’s scheme exhibited low computational overhead on IoT devices, making them suitable for resource-constrained environments.
  • Scalability: The proposed scheme is highly scalable due to its efficient attribute management and outsourced computation design, which ensures minimal performance degradation as the number of users and attributes increases.

8.3. Experimental Results

This paper conducted simulations to compare the proposed scheme against Lewko et al.’s scheme, Chase et al.’s scheme, and Zhang et al.’s scheme on an experimental setup emulating resource-constrained IoT devices (e.g., Raspberry Pi 4 with 4GB RAM and ARM Cortex-A72 CPU). The cloud environment was simulated using a high-performance server with multi-core architecture.
Figure 2—Decryption time vs. number of attributes:
Figure 2. Decryption time against the number of attributes, ref. [55].
  • The proposed scheme demonstrated a significantly lower decryption time as the number of attributes increased thanks to the partial decryption outsourced to C S P .
  • In Lewko et al.’s scheme, the decryption time scaled linearly with the number of attributes, causing performance degradation on the IoT devices.
Figure 3—Encryption time comparison:
Figure 3. Encryption time comparison, refs. [55,56].
  • The encryption time in the proposed scheme was moderate, and it remained competitive with Lewko et al.’s and Zhang et al.’s schemes.
  • Chase et al.’s scheme exhibited higher encryption times, limiting its suitability for real-time IoT applications.
Figure 4—Ciphertext size comparison:
Figure 4. Ciphertext size comparison, refs. [55,57].
  • Zhang et al.’s scheme achieved a constant ciphertext size, while the proposed scheme maintained compact ciphertexts with a slight increase as attributes grew.
  • Lewko et al.’s ciphertext size grew significantly with more attributes, increasing storage and communication overhead.
Finally, the experimental evaluation and comparative analysis demonstrate that the proposed scheme achieves superior performance in terms of decryption efficiency, computational overhead, and scalability compared to existing access control schemes. By leveraging outsourced decryption and optimizing attribute management, the proposed scheme addresses the limitations of traditional attribute-based encryption models while meeting the stringent requirements of IoT environments.

9. Conclusions

This paper presents a leakage-resilient access control scheme designed for resource-constrained IoT environments. By leveraging ABE with partial decryption outsourcing, the scheme significantly reduces the computational burden on IoT devices while ensuring fine-grained access control and resilience against master key leakage and side-channel attacks. The introduced security analysis confirms the scheme’s robustness against common attack vectors, while performance evaluations demonstrate superior efficiency, scalability, and reduced computational overhead compared to existing solutions. The scheme is particularly well suited for real-world IoT applications, including smart healthcare, industrial IoT, and smart cities.
Future work will focus on integrating post-quantum cryptographic primitives, enhancing user privacy protections, and enabling cross-domain interoperability to further strengthen the scheme’s adaptability and resilience in evolving IoT ecosystems.

Funding

This work was supported by the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [Grant No. KFU250164].

Data Availability Statement

Data are contained within the article.

Acknowledgments

The author extends his appreciation to the Deanship of Scientific Research, Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia [Grant No. KFU250164].

Conflicts of Interest

The author declares no conflicts of interest.

Nomenclature and Abbreviations

Acronyms and notations:
Symbol/AcronymDescription
Acronyms
ABEAttribute-Based Encryption
AAAttribute Authority
CSPCloud Service Provider
IoTInternet of Things
DLPDiscrete Logarithm Problem
CP-ABECiphertext Policy Attribute-Based Encryption
Notations
λ Security Parameter
UUniversal Attribute Set
M S K Master Secret Key
P P Public Parameters
S K Secret Key
T K Transformation Key
AAccess Structure (matrix)
ρ Mapping from Attributes to Rows of A
C T Ciphertext
P T Partial Ciphertext
g , g 1 , g 3 Generators of Composite-Order Groups
e ( · , · ) Bilinear Pairing
sRandom Secret Shared in the Sccess Structure
v , v Random vector used in Encryption
zRandom Value used in Key Generation
MPlaintext Message

References

  1. Zolfaghari, B.; Yazdinejad, A.; Dehghantanha, A.; Krzciok, J.; Bibak, K. The Dichotomy of Cloud and IoT: Cloud-Assisted IoT from a Security Perspective. arXiv 2022, arXiv:2207.01590. [Google Scholar]
  2. Cook, J.; ur Rehman, S.; Khan, M.A. Security and Privacy for Low Power IoT Devices on 5G and Beyond Networks: Challenges and Future Directions. IEEE Access 2023, 11, 39295–39317. [Google Scholar] [CrossRef]
  3. Farman, H.; Jan, B.; Javed, H.; Ahmad, N.; Iqbal, J.; Arshad, M.; Ali, S. Multi-criteria based zone head selection in Internet of Things based wireless sensor networks. Future Gener. Comput. Syst. 2018, 87, 364–371. [Google Scholar] [CrossRef]
  4. Huang, X.; Craig, P.; Lin, H.; Yan, Z. SecIoT: A security framework for the Internet of Things. Secur. Commun. Netw. 2015, 9, 3083–3094. [Google Scholar] [CrossRef]
  5. Bate, K.O.; Kumar, N.; Khatri, S.K. Framework for authentication and access control in IoT. In Proceedings of the 2017 2nd International Conference on Telecommunication and Networks (TEL-NET), Noida, India, 10–11 August 2017. [Google Scholar] [CrossRef]
  6. Alshehri, A.H.; Sandhu, R. Access Control Models for Cloud-Enabled Internet of Things: A Proposed Architecture and Research Agenda. In Proceedings of the 2016 IEEE 2nd International Conference on Collaboration and Internet Computing (CIC), Pittsburgh, PA, USA, 1–3 November 2016. [Google Scholar] [CrossRef]
  7. Carlin, A.; Hammoudeh, M.; Aldabbas, O. Defence for distributed denial of service attacks in cloud computing. Procedia Comput. Sci. 2015, 73, 490–497. [Google Scholar] [CrossRef]
  8. Belguith, S. Enhancing data security in cloud computing using a lightweight cryptographic algorithm. In Proceedings of the 11th International Conference on Autonomic and Autonomous Systems, Rome, Italy, 24–29 May 2015. [Google Scholar]
  9. Li, F.; Rahulamathavan, Y.; Conti, M.; Rajarajan, M. Robust access control framework for mobile cloud computing network. Comput. Commun. 2015, 68, 61–72. [Google Scholar] [CrossRef]
  10. Raptis, T.P.; Passarella, A.; Conti, M. Data Management in Industry 4.0: State of the Art and Open Challenges. IEEE Access 2019, 7, 97052–97093. [Google Scholar] [CrossRef]
  11. Bertin, E.; Hussein, D.; Sengul, C.; Frey, V. Access control in the Internet of Things: A survey of existing approaches and open research questions. Ann. Telecommun. 2019, 74, 375–388. [Google Scholar] [CrossRef]
  12. Bethencourt, J.; Sahai, A.; Waters, B. Ciphertext-Policy Attribute-Based Encryption. In Proceedings of the 2007 IEEE Symposium on Security and Privacy, Berkeley, CA, USA, 20–23 May 2007. [Google Scholar] [CrossRef]
  13. Goswami, P.; Faujdar, N.; Debnath, S.; Khan, A.K.; Singh, G. Investigation on storage level data integrity strategies in cloud computing: Classification, security obstructions, challenges and vulnerability. J. Cloud Comput. 2024, 13, 45. [Google Scholar] [CrossRef]
  14. Luqman, A.; Mahesh, R.; Chattopadhyay, A. Privacy and Security Implications of Cloud-Based AI Services: A Survey. arXiv 2024, arXiv:2402.00896. [Google Scholar] [CrossRef]
  15. Gorasia, N.; Srikanth, R.; Doshi, N.; Rupareliya, J. Improving Security in Multi Authority Attribute Based Encryption with Fast Decryption. Procedia Comput. Sci. 2016, 79, 632–639. [Google Scholar] [CrossRef][Green Version]
  16. Zhang, X.; Wu, F.; Wang, Y.; Zhao, W.; Wang, W. Multi-authority attribute-based encryption scheme with constant-size ciphertexts and user revocation. Concurr. Comput. Pract. Exp. 2018, 31, e4678. [Google Scholar] [CrossRef]
  17. Bursztein, E.; Invernizzi, L.; Kral, K.; Moghimi, D.; Picod, J.M.; Zhang, M.Y. Generic Attacks against Cryptographic Hardware through Long-Range Deep Learning. arXiv 2023, arXiv:2306.07249. [Google Scholar] [CrossRef]
  18. Green, M.; Hohenberger, S.; Waters, B. Outsourcing the decryption of ABE ciphertexts. In Proceedings of the 20th USENIX Security Symposium (USENIX Security 11), San Francisco, CA, USA, 8–12 August 2011. [Google Scholar]
  19. Roman, R.; Zhou, J.; Lopez, J. On the features and challenges of security and privacy in distributed internet of things. Comput. Netw. 2013, 57, 2266–2279. [Google Scholar] [CrossRef]
  20. Ma, Y.; Ma, R.; Lin, Z.; Zhang, R.; Cai, Y.; Wu, W.; Wang, J. Improving Age of Information for Covert Communication With Time-Modulated Arrays. IEEE Internet Things J. 2024, 12, 1718–1731. [Google Scholar] [CrossRef]
  21. Zhang, R.; Cheng, L.; Wang, S.; Lou, Y.; Gao, Y.; Wu, W.; Ng, D.W.K. Integrated Sensing and Communication with Massive MIMO: A Unified Tensor Approach for Channel and Target Parameter Estimation. IEEE Trans. Wirel. Commun. 2024, 23, 8571–8587. [Google Scholar] [CrossRef]
  22. Chen, J.; Ma, H. Efficient decentralized attribute-based access control for cloud storage with user revocation. In Proceedings of the 2014 IEEE International Conference on Communications (ICC), Sydney, Australia, 10–14 June 2014. [Google Scholar] [CrossRef]
  23. Yang, K.; Jia, X.; Ren, K. Attribute-based fine-grained access control with efficient revocation in cloud storage systems. In Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security, Berlin, Germany, 4–8 November 2013. [Google Scholar] [CrossRef]
  24. Zhang, Q.; Li, Y.; Yuan, J.; Gan, Y.; Luo, X. Access Control Based on Ciphertext Attribute Authentication and Threshold Policy for the Internet of Things. Sensors 2019, 19, 5237. [Google Scholar] [CrossRef]
  25. Xu, S.; Yang, G.; Mu, Y.; Liu, X. A secure IoT cloud storage system with fine-grained access control and decryption key exposure resistance. Future Gener. Comput. Syst. 2019, 97, 284–294. [Google Scholar] [CrossRef]
  26. Sowmiya, M.; Adimoolam, M. Secure cloud storage model with hidden policy attribute based access control. In Proceedings of the 2014 International Conference on Recent Trends in Information Technology, Chennai, India, 10–12 April 2014. [Google Scholar] [CrossRef]
  27. Myint, P.W.W.; Hlaing, S.Z.; Htoon, E.C. A Policy Revocation Scheme for Attributes-based Encryption. In Proceedings of the 10th International Conference on Advances in Information Technology, Bangkok, Thailand, 10–13 December 2018. [Google Scholar] [CrossRef]
  28. Deng, H.; Qin, Z.; Wu, Q.; Guan, Z.; Yin, H. Revocable Attribute-Based Data Storage in Mobile Clouds. IEEE Trans. Serv. Comput. 2022, 15, 1130–1142. [Google Scholar] [CrossRef]
  29. Yu, Z.; Au, M.H.; Xu, Q.; Yang, R.; Han, J. Towards leakage-resilient fine-grained access control in fog computing. Future Gener. Comput. Syst. 2018, 78, 763–777. [Google Scholar] [CrossRef]
  30. Tseng, Y.; Wu, J.; Huang, S.; Tsai, T. Leakage-resilient outsourced revocable certificateless signature with a cloud revocation server. Inf. Technol. Control 2020, 49, 464–481. [Google Scholar] [CrossRef]
  31. Das, A.K.; Wazid, M.; Yannam, A.R.; Rodrigues, J.J.P.C.; Park, Y.H. Provably Secure ECC-Based Device Access Control and Key Agreement Protocol for IoT Environment. IEEE Access 2019, 7, 55382–55397. [Google Scholar] [CrossRef]
  32. Miorandi, D.; Sicari, S.; Pellegrini, F.D.; Chlamtac, I. Internet of Things: Vision, Applications and Research Challenges. Ad Hoc Netw. 2012, 10, 1497–1516. [Google Scholar] [CrossRef]
  33. Deng, H.; Wu, Q.; Qin, B.; Mao, J.; Liu, X.; Zhang, L.; Shi, W. Who Is Touching My Cloud. In Computer Security, Proceedings of the 19th European Symposium on Research in Computer Security, Wroclaw, Poland, 7–11 September 2014; Springer: Cham, Switzerland, 2014. [Google Scholar] [CrossRef]
  34. Yang, Y.; Zheng, X.; Guo, W.; Liu, X.; Chang, V. Privacy-Preserving Smart IoT-based Healthcare Big Data Storage and Self-Adaptive Access Control System. Inf. Sci. 2019, 479, 567–592. [Google Scholar] [CrossRef]
  35. Zeng, Z.; Zhang, J. Based on the role of internet of things security in the management of enterprise human resource information leakage. Wirel. Commun. Mob. Comput. 2021, 2021, 5936390. [Google Scholar] [CrossRef]
  36. Cheng, R.; Wu, K.; Su, Y.; Li, W.; Cui, W.; Tong, J. An Efficient ECC-Based CP-ABE Scheme for Power IoT. Processes 2021, 9, 1176. [Google Scholar] [CrossRef]
  37. Belguith, S.; Kaaniche, N.; Hammoudeh, M.; Dargahi, T. PROUD: Verifiable Privacy-Preserving Outsourced Attribute Based SignCryption Supporting Access Policy Update for Cloud Assisted IoT Applications. Future Gener. Comput. Syst. 2020, 111, 899–918. [Google Scholar] [CrossRef]
  38. Liu, L.; Wang, H.; Zhang, Y. Secure iot data outsourcing with aggregate statistics and fine-grained access control. IEEE Access 2020, 8, 95057–95067. [Google Scholar] [CrossRef]
  39. Miao, S.; Zhang, X.; Liu, Z. Fine-grained access control mechanism of energy internet. Wuhan Univ. J. Nat. Sci. 2022, 27, 231–239. [Google Scholar] [CrossRef]
  40. Yu, S.; Wang, C.; Ren, K.; Lou, W. Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing. In Proceedings of the IEEE Conference on Computer Communications, San Diego, CA, USA, 14–19 March 2010. [Google Scholar] [CrossRef]
  41. Meligy, A.; Diab, H.; Torky, M. An Access Control Model for Avoiding Outsourcing Risks. Int. J. Comput. Appl. 2012. [Google Scholar] [CrossRef]
  42. Zhang, L.; Gao, X.; Mu, Y. Secure data sharing with lightweight computation in e-health. IEEE Access 2020, 8, 209630–209643. [Google Scholar] [CrossRef]
  43. Hao, J.; Huang, C.; Ni, J.; Rao, H.; Xian, M.; Shen, X. Fine-grained data access control with attribute-hiding policy for cloud-based iot. Comput. Netw. 2019, 153, 1–10. [Google Scholar] [CrossRef]
  44. Xu, Z.; Zhang, S.; Han, H.; Dong, X.; Zhang, Z.; Wang, H.; Tian, W. Blockchain-aided searchable encryption-based two-way attribute access control research. Secur. Commun. Netw. 2022, 2022, 2410455. [Google Scholar] [CrossRef]
  45. Nguyen, K.T.; Oualha, N.; Laurent, M. Securely Outsourcing the Ciphertext-Policy Attribute-Based Encryption. World Wide Web 2017, 21, 169–183. [Google Scholar] [CrossRef]
  46. Pal, S.; Hitchens, M.; Varadharajan, V.; Rabehaja, T. Policy-based access control for constrained healthcare resources in the context of the internet of things. J. Netw. Comput. Appl. 2019, 139, 57–74. [Google Scholar] [CrossRef]
  47. Riad, K. Multi-Authority Trust Access Control for Cloud Storage. In Proceedings of the 4th IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS), Beijing, China, 17–19 August 2016; pp. 429–433. [Google Scholar] [CrossRef]
  48. Riad, K. Revocation Basis and Proofs Access Control for Cloud Storage Multi-Authority Systems. In Proceedings of the 3rd IEEE International Conference on Artificial Intelligence and Pattern Recognition (AIPR), Lodz, Poland, 19–21 September 2016; pp. 118–127. [Google Scholar] [CrossRef]
  49. Riad, K. Blacklisting and Forgiving Coarse-grained Access Control for Cloud Computing. Int. J. Secur. Appl. 2016, 10, 187–200. [Google Scholar] [CrossRef]
  50. Riad, K.; Yan, Z. Multi-Factor Synthesis Decision-Making for Trust-Based Access Control on Cloud. Int. J. Coop. Inf. Syst. 2017, 26, 1–33. [Google Scholar] [CrossRef]
  51. Nannipieri, P.; Crocetti, L.; Di Matteo, S.; Fanucci, L.; Saponara, S. Hardware Design of an Advanced-Feature Cryptographic Tile within the European Processor Initiative. IEEE Trans. Comput. 2023, 1–14. [Google Scholar] [CrossRef]
  52. Bernstein, D.J.; Lange, T. Post-quantum cryptography. Nature 2017, 549, 188–194. [Google Scholar] [CrossRef]
  53. Campagna, M.; LaMacchia, B.; Ott, D. Post Quantum Cryptography: Readiness Challenges and the Approaching Storm. arXiv 2021, arXiv:2101.01269. [Google Scholar]
  54. Dan, B.; Goh, E.J.; Nissim, K. Evaluating 2-DNF formulas on ciphertexts. In Theory of Cryptography, Proceedings of the Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, 10–12 February 2005; Springer: Berlin/Heidelberg, Germany, 2005; pp. 325–341. [Google Scholar]
  55. Lewko, A.; Rouselakis, Y.; Waters, B. Achieving leakage resilience through dual system encryption. In Theory of Cryptography, Proceedings of the 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, 28–30 March 2011; Springer: Berlin/Heidelberg, Germany, 2011; pp. 70–88. [Google Scholar]
  56. Chase, M. Multi-authority Attribute Based Encryption. In Theory of Cryptography, Proceedings of the 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, 21–24 February 2007; Vadhan, S.P., Ed.; Springer: Berlin/Heidelberg, Germany, 2007; pp. 515–534. [Google Scholar]
  57. Zhang, Y.; Li, J.; Yan, H. Constant Size Ciphertext Distributed CP-ABE Scheme with Privacy Protection and Fully Hiding Access Structure. IEEE Access 2019, 7, 47982–47990. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.