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

24 April 2022

A Study on Vehicle Monitoring Service Using Attribute-Based Security Scheme in Cyber–Physical Systems

,
and
1
Department of Multimedia Science, Chungwoon University, Incheon-si 32244, Korea
2
Division of Information Technology Education, Sunmoon University, Asan-si 31460, Korea
3
Department of Management, Dongguk University, Gyeonggu-si 38066, Korea
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Security Research and Challenges in Cyber-Physical Systems

Abstract

Cyber–physical systems (CPSs) is a manufacturing infrastructure that requires high reliability real-time automatic control characteristics. It is widely used in industrial fields such as production and transportation. An example is a future transportation network system that controls information such as sensors and actuators based on a network. However, CPSs are susceptible to cyberattacks as network-based interconnections increase. Data handled between a car and a fog server can put personal privacy at risk, so it is essential to introduce security technologies such as encryption. A login/password method is required to satisfy the demand for secure sharing and utilization by service users. Based on the attributes of these target service users, the authority to decrypt data is delegated to legitimate users, and a pull-in encryption method is required. In this paper, we propose a method to safely protect the system from attacks through the method of managing attribute-based delegation of authority. Using a semantic security model, the proposed system is proven safe against public attacks by malicious users, and it can be used to protect against attacks on a smart car.

1. Introduction

The rapid development of sensing, activating, control, and networking technologies has enabled close fusion between various individuals that make up the physical world, such as machinery, electronic equipment, infrastructure, energy supply and consumption facilities, medical devices, and automobiles. Complex systems in systems technology, which fundamentally differentiate themselves from existing individual electronic devices by collecting and analyzing necessary information from physical objects through various sensors and sharing processed information with various controllers and actuators, have been proposed and developed. In this way, a cognitive control system in which cyber world information processing functions and the physical world respond closely to each other and cooperate is called cyber–Physical Systems (CPSs). Cyber–Physical systems are expected to be applied to most information processing and control computing fields, contributing dramatically to the improvement of efficiency, safety, and security. In particular, on the basis of intelligent cyber information collection and optimal control technologies, it is expected to be applied to various fields such as city intelligent traffic control, building group energy-consumption analysis and optimal control, and smart space service. The Internet of Things (IoT), combined with the main social infrastructure of real life, reveals dangers that exist in cyberspace, such as the theft of personal information by hacking home appliances and spreading malware infections in the real world.
However, as the IoT combines major social infrastructures with our real-life things, the number of security threats is skyrocketing. For example, the dangers in cyberspace, such as theft of personal information by hacking home appliances and malware infections, are appearing. It is also possible to hack passwords to open the doors of smart cars, illegally exercise authority that only the owner of the smart car has, force the smart car itself to move, or steal it. Not only that, it is also possible to track the locations of smart cars and remotely attack their hardware to prevent them from working properly [1,2,3,4].
Big data environments are combined with the IoT infrastructure and cloud environments to provide platforms and services, but security solutions that remain in individual units are missing consistent security policies, slowing down decision-making, etc., and are becoming a problem. Therefore, new customized security services are needed in the various network environments (e.g., the IoT, the CPSs, the cloud, big data, etc.).
New combined environmental urban transport systems will continue to be important for safety and will be combined with new IoT infrastructure for technologies that detect and avoid risks. In addition, the importance of safety will not change in future urban transportation systems, and the demand for technologies to detect and avoid the risks of movement will increase. In transportation networks, a huge amount of data is exchanged, such as the number of automobiles, the movements of millions of people, and the transfer of personal information, which are all bound together by external environmental information.
Modern mobile communication systems are mechanisms that process information that is collected on a central server and sent to each mobile unit. At present, the time available for judgment is insufficient because of problems such as network latency. In other words, moving a large amount of data requires individual real-time processing. In addition, it is possible to obtain necessary information, such as nearby accident information and traffic jam information, by exchanging information on geographically close movement or movement in previous similar situations. However, it is very difficult to collect information from many mobile units on a central server and make it searchable. In such a case, it is necessary to extract only important data, reduce the total storage, and transfer only important information. In order to collect only important information, various data volumes, such as car camera images and driver movement, are immediately analyzed; risk is calculated, and avoidance behavior is supported or automated [5].
Software-defined network (SDN) technology refers to network structures and devices that allow distributed network equipment to be easily managed by software. This technology enables network operators to manage network resources in an active and automated manner. It is possible to reduce the management costs of the network and respond quickly to sudden situations. This technology flexibly controls networks through programs such as network virtualization and network function virtualization. For this reason, SDN separates the data plane and control plane of the network, providing a standardized interface between them, allowing network operators to program the control plane for different situations. Therefore, it is possible to control the communication function performed on the data side in various ways. The term SDN has spread throughout the world and is being researched by many institutions and companies. Under the SDN concept, various network control structures and implementations have been proposed. Although the number of cases where SDN is introduced into actual network systems is increasing, the environment in which SDN is applied is limited, and various types of SDNs have not become widespread. Among the security vulnerabilities of SDN technology, the privileged elevation attack causes a big problem in the control function by allowing the authority to be arbitrarily not authenticated.
The information collected needs to be shared only by legitimate users, and the authority to access data needs to be controlled, depending on the situation. A login/password method is required to satisfy the demand for secure sharing and utilization by service users. Based on the attributes of these target service users, the authority to decrypt data is delegated to legitimate users, and a pull-in encryption method is required.
In this paper, as a technical countermeasure for these problems, we study how to encrypt data so that only users with legitimate attributes can access them. Property delegation in a fog computing environment and Ciphertext Policy Attribute-Based Threshold Decryption (CP-ABTD), a retractable encryption method, can be applied to provide a monitoring service for vehicles.
The structure of this paper is as follows: Section 2 is a study of the underlying technologies and threats for the proposed system. Section 3 explains the detailed operational processes of the system and the scenarios in which attribute-based delegation of authority and the retractable encryption method are applied. In Section 4, the proposed system is shown to be tamper-proof and publicly offered, demonstrating its security compared to existing attribute-based encryption-only or delegation-of-authority encryption algorithms. Finally, Section 5 offers conclusions [6,7].

3. Proposed System

3.1. Overview

The proposed system is constructed based on the structure of fog computing. At the top, it has the function of a cloud server in cloud computing. This step consists of a data service provider and a proxy manager. The main roles are data storage and data and proxy server management. That is, the data store is performed in the data service provider. In addition, the proxy manager authenticates and manages proxies. In the intermediate stage, proxy servers are located. Proxy servers mainly play the role of data collection, process, and storing. In addition, re-encryption is performed on the data collected at the edge stage. Re-encryption is performed according to the user who requests it by checking the delegation or withdrawal list of stored data. At the bottom edge stage, there are objects that produce or collect data, such as smart cars and smart signals. These individuals are responsible for encrypting data produced or collected. Encryption is performed using the user’s accessible authority structure. The user may access data through a cloud server or a proxy server. Decryption authority is required to access encrypted data.
Figure 4 shows the network model of the proposed system.
Figure 4. Network model of the proposed system.

3.2. Attribute-Based Encryption

The system proposed in this paper uses an attribute-based encryption algorithm. It operates more flexibly than the existing attribute-based encryption algorithm. In other words, the delegation and withdrawal of attributes are simultaneously performed. The delegate holding the secret key may delegate the decryption authority of the ciphertext to the secondary user. Here, the delegate and the secondary user must correspond to a set of attributes. In addition, the delegate can decide whether to delegate his or her authority and then withdraw the attribute. This is to revoke the authority to decrypt the delegated ciphertext so that it cannot be accessed.
The encryption algorithm consists of seven steps in total. Each algorithm includes a preparation step, a key generation step, an encryption step, a delegation step, a secondary delegation step, a secondary decoding step, and a decryption step. The preparation step and the key generation step are performed by a central certification authority. The encryption and delegation steps are performed by the delegate. The secondary delegation step and the secondary decryption step are performed by the policy management agency. Finally, the decryption step is performed by the secondary user.

3.2.1. Bilinear Mapping

A bilinear map is a function that combines two vector spaces to create another third vector space. Let G 1 , G 2 , and G T be cyclic groups of the same order. Given that G 1 × G 2 is a product group, the bilinear map to G T , the product of G 1 and G 2 , can be expressed as follows: g is the generator of G X , e is a function of the bilinear mapping, and u and v are elements of G 1 and G 2 . Bilinear mapping e : G 1 × G 2 G T ( G T being the output space of the bilinear mapping) with respect to the two cyclic groups G 1 , G 2 has the following three characteristics [5]:
  • Bilinear: e ( u a , v b ) = e ( u , v ) a b for all u G 1 , v G 2 and all a , b Z ;
  • Nondegenerate: e ( g , g ) 1 for the generator g G X of G X ( X = 1 , 2 ) ;
  • Computable: There is an efficient algorithm to calculate e ( u , v ) for all u G 1 , v G 2 .

3.2.2. Access Structure

The decryption of the ciphertext is performed when the user’s attribute belongs to the attribute set of the secret key.
For example, a medical college is conducting research on a new strain of COVID-19. If another medical university researcher needs access to the data studied, the private key must be that of a university professor and must be created based on the attributes of the research team, the research team leader, or the department head. The structure (university professor ∧ research team) ∨ (research team leader ∨ department dean) must be created as shown in Figure 5 (‘∧’ is an AND gate, and ‘∨’ is an OR gate).
Figure 5. The Structure Access.
If the researcher is a university professor and dean, the secret key includes the attribute (university professor, dean). When trying to access the data, the researcher did not satisfy the AND gate called the university professor and research team, but the OR gate called the dean so that the researcher could access the data.

3.3. System Operation

The proposed system is capable of controlling secondary users’ access using delegation and withdrawal of access rights based on attribute-based encryption. The proposed system generates data from equipment such as smart cars and smart traffic lights. The generated data are transmitted through the peripheral infrastructure through V2X. The transmitted data include personal information. Encryption is in progress to prevent the leakage of personal information. At this time, the infrastructure does not have enough resources for calculation. Therefore, we try to solve this problem using the structure of fog computing.
The notation for understanding this paper is shown in Table 1.
Table 1. The notation.
Figure 6 shows the operation of the proposed system based on a virtual scenario. The configured system consists of an authorized certification authority, a data generator, a data collection and authority examiner, and a secondary user of the data.
Figure 6. The configuration of the scenario.
The proposed system will be explained focusing on the scenario of the vehicle monitoring system for violating traffic laws. The procedure of the encryption algorithm capable of delegating and withdrawing attributes consists of seven steps. Detailed methods of each step are described in Section 3.4. The Traffic Control Center, an authorized certification body, proceeds with the preparation stage and the key generation stage. The vehicle, which is a data generator and a delegator of authority, performs an encryption step and a delegation step. In the fog server in charge of collecting and processing data with the policy management agency, a secondary delegation step and a secondary decryption step are performed. The police, who are the data user and the delegator of authority, proceed with the decryption step.
It is assumed that all vehicles have completed the delegate stage at the time of registration of the vehicle. On public roads, police (delegate) find suspicious vehicles. When the police want to view information on a vehicle (delegator), they organize a scenario in which access rights are reviewed and approved by the government.
  • When the vehicle is first registered, the transportation center proceeds with an algorithm of the preparation step. In this step, the public key ( p k ) and the master key ( m k ) are generated using the system parameter. The algorithm of the key generation step is performed in the following order to generate a distributed key. Two distribution keys are generated using vehicle attribute ( w ) and identifier ( I u ). The generated distribution keys ( s k w I u , 1 , s k w I u , 2 ) are delivered to the Fog server and the vehicle, respectively;
  • The vehicle generates a ciphertext ( c τ ) by performing an algorithm of the encryption step. The generated ciphertext is stored in the Fog server database. The vehicle delegates the decoding authority to the police through the algorithm of the delegation step. In this step, the secret distribution key ( s k w ^ I j , 2 ) for the police is generated and transmitted to the police using the attribute set ( w ^ ) defined by the vehicle and the identifier ( I j ) of the police. In addition, the attribute conversion key ( g r ) is divided and transmitted to the policy management agency;
  • Police cars require approval from policy management agencies to view vehicle data. The policy management agency approves or rejects the police’s access after determining the legitimacy. (This scenario is mainly approved);
  • When the policy management agency approves the data access to the police, it proceeds with the algorithm of the secondary delegation step to generate a secret distribution key ( s k w ^ I j , 1 ) using the attribute set ( w ^ ). Subsequently, the algorithm of the secondary decryption step is performed to generate the re-ciphertext ( c τ ). Re-ciphertext are generated using secret distribution keys and police identifiers. This generated re-ciphertext is sent to the police;
  • The police decrypt the secret distribution key ( s k w ^ I j , 2 ) received from the vehicle, and the re-ciphertext ( c τ ) received from the policy management agency to view the data.

3.4. Detailed Operation of System

Figure 7 shows the detailed operations of the system.
Figure 7. The concept of CP-ABTD.
First, the certification body executes the preparation step. The certification authority generates security parameter k to support delegation of authority and then follows the key generation steps to communicate with the policy manager and the delegator. The certification body and policy manager can be one administrative body with a trusted third party.
Privilege delegation uses the transmitted security parameters and the session key to provide the policy administrator with settings for encryption. Then, a random value is generated and sent to the authority auditor (the proxy). It then provides the delegate with the value set using the session key.
A permissions examiner generates a random value and a temporary value based on this and goes through the confirmation process with the policy administrator. The policy administrator uses the random value transmitted from the proxy and the information that authenticates the authority delegation to generate the encrypted data to be passed and sends the encrypted data to the delegate.
Finally, the delegate uses a random value as the session key that allows the policy administrator to authenticate the preissued delegator with the data encrypted and sent on behalf of the delegate. It can be decrypted. The detailed operation process has been simplified into seven stages (preparation, key generation, encryption, delegation, secondary delegation, secondary decryption, and decryption) as follows.

3.4.1. Preparation ( k )

With security parameter k as the input, generate the generator, g , as well as G 0 , which is a prime order, p .
The bilinear map is e ^ : G 0 × G 0 G 1 , and the system attribute group is Ω = ( a 1 , a 2 , a n ) (where n is an integer).
a j Ω selects a random element, t j Z p * .
Use Equation (1) to generate y , public key ( p k ), and master key (m k ).
y = e ^ ( g , g ) α ( α   R Z p * , T j = g t j ( 1 j n ) ) p k = ( e ^ , g , y , T j ( 1 j n ) ) m k = ( α , t j ( 1 j n ) )

3.4.2. Key generation ( m k , w , I u )

Performed with the attribute group, as well as the delegator identifier, I u , as follows:
  • Base Component of the Private Key
Create an element for the private key through Equation (2).
d 0 = g α u i d ( u i d   R Z p * )
2.
Attribute Component of the Private Key
Select attributes a j w , u j   R Z p * and calculate d j , 1 = g u j t j 1 and d j , 2 = g ( u i d u j ) t j 1 .
Send the first private key share, s k w I u , 1 = ( a j w : d j , 1 ) , to the proxy, and send the second private key share, s k w I u , 2 = ( d 0 , a j w : d j , 2 ) , to the delegator.

3.4.3. Encryption ( m , τ , p k ) ( m G 1 )

Randomly select s Z p * and calculate Equation (3). Equation (4) is the calculation formula of the leaf attribute.
c 0 = g s ,   c 1 = m y s = m e ^ ( g , g ) α s
a j , i τ , c j , i = T j S i
Create ciphertext c τ = ( τ , c 0 , c 1 , a j , i τ : c j , i ) of the delegator.

3.4.4. Delegation ( s k w I u , 2 , w ^ , I j )

Randomly select r Z p , and set g t j , r = g r j with a j w ^ .
Set the attribute switch key, s k w w ^ = g r , and calculate d j , 2 ^ with a j w ^ using Equation (5).
d j , 2 ^ = g ( u i d u j ) t j 1 r = g ( u i d u j ) t j 1 r j t j 1 = g ( u i d u j ^ ) t j 1 ( u j ^ = u j + r j )
Send the private key share s k w ^ I j , 2 = ( d 0 , a j w ^ : d j , 2 ^ ) , to the delegatee, and send w ^ and s k w w ^ to the proxy.

3.4.5. Secondary Delegation ( s k w I u , 1 , w ^ , s k w w ^ )

Check the attribute delegation list; if the target is eligible to be delegated attributes, calculate s k w ^ I j , 1 with a j w ^ and calculate as in Equation (6). Otherwise, do not perform the calculation.
d j , 1 ^ = g u j t j 1 + r = g u j ^ t j 1
Send private key share s k w ^ I j , 1 = ( a j w ^ : d j , 1 ^ ) to the delegatee.

3.4.6. Secondary decryption ( c τ , s k w ^ I i , 1 , I j )

Check the attribute revocation list; if the target is not to have attributes revoked, calculate, and calculate as in Equation (7).
Otherwise, do not perform the calculation. The calculation is conducted with all attributes a j w ^ .
c j ,   i ^ = e ^ ( T j S i , g u j t j 1 ) = e ^ ( g , g ) a j w ^ u j s i ^ c τ ^ = ( τ ^ ,   c 0 ,   c 1 ,   a j ,   i τ ^ :   c j ,   i ^ )

3.4.7. Decryption ( c τ ^ , s k w I i , 2 )

Calculate Equation (8), with all attributes, a j w ^
c τ = a j w ^ e ^ ( T j S i , g ( u i d u j ^ ) t j 1 ) a j w ^ e ^ ( g t j s i , g ( u i d u j ^ ) t j 1 ) = e ^ ( g , g ) a j w ^ ( u i d u j ) s i
Calculate Equation (9).
e ^ ( c 0 , d 0 ) c j , i ^ c τ = e ^ ( g s , g α u i d ) e ^ ( g , g ) Σ a j w u j s i e ^ ( g , g ) Σ a j w ( u i d u j ) s = e ^ ( g s , g α u i d ) e ^ ( g , g ) u i d s = e ^ ( g s , g α )
Calculate Equation (10) and restore m .
m = c 1 e ^ ( g s , g α ) = m e ^ ( g , g ) α s e ^ ( g s , g α )

4. Analysis

4.1. Comparison with Existing System

Attribute-based encryption has been studied, focusing on malicious conspiracy attacks rather than conventional encryption algorithms. In addition, attribute-based encryption capable of attribute withdrawal can be further developed to delegate or revoke attributes. In this study, the safety against attribute withdrawal and modulation attacks is analyzed and compared with previous studies. Attribute withdrawal is to remove or disable the delegated attribute. For example, when the attribute value “a” is withdrawn, the certification authority notifies the proxy not to perform an operation related to “a” and to remove “a” from the system attribute set in which all attributes are integrated. Thereafter, a new secret key is issued and transmitted to all users who have a secret key related to “a”. It also regenerates the re-encryption key.
The function of delegating and withdrawing user attributes is suitable for a cyber–physical system environment. The delegation of authority is the delegation of authority to the proxy to provide their data. The proxy can determine whether the delegate’s access to the delegate’s data is legitimate. In the proposed method, the attribute conversion key was transmitted to the policy management agency to enable justification.
In this study, we propose a safe method for modulating the attacks of attribute-based encryption capable of attribute withdrawal. For authority management and delegation, the proxy determines the legitimacy of access and provides access authority management. Here, justification is determined using the dynamic threshold password. This can solve the problem of modulation attacks. Table 2 shows a comparison between the proposed system and existing frameworks.
Table 2. Comparisons with the Proposed System.

4.2. Security

The level of security for attribute-based re-encryption is analyzed based on things presented by the cloud [32,33]. These include unidirectionality, data confidentiality, noninteraction, intransitivity, multiple uses, re-encryption control, and master key security.
Unidirectionality means that reverse re-encryption or decryption cannot be performed. Data confidentiality means that data cannot be obtained from an entity without privileges for the ciphertext. Noninteraction means no entity other than the data owner is needed to generate the encryption key; interaction cannot be used to generate the encryption key or the basic data needed for encryption. With intransitivity, two different re-encryptions cannot be combined to obtain a new ciphertext. In other words, different ciphertexts cannot be combined to generate a new ciphertext to be reused, nor can the information needed for decryption be obtained. With multiple uses, re-encrypted data can be re-encrypted again and distributed. This is different from intransitivity, and it is not about generating a new ciphertext by combining re-encrypted ciphertexts. It means that re-encrypted data can be re-encrypted using a proper encryption key for distribution. Re-encryption control, whether or not to perform re-encryption, can be controlled by the data owner. It means that re-encryption for distribution for multiple uses is possible. However, the data owner must be able to decide whether to perform the re-encryption or not. In terms of master key security, a user cannot obtain a master key of an owner by colluding with another entity. In other words, the data user must not be able to obtain the master key of the data owner by any other means.
The proposed model meets the following criteria, which are satisfied in typical proxy re-encryption: unidirectionality, data confidentiality, noninteraction, intransitivity, and master key security. In addition, the model satisfies re-encryption control but does not satisfy multiple uses. In the model that includes re-encryption control, when data generated by a vehicle are sent encrypted by the vehicle, the proxy will re-encrypt them. This is because access attributes for a re-encrypted ciphertext can be delegated or revoked. With respect to multiple uses, the model does not assume there is a case in which re-encrypted ciphertext is re-encrypted and used. Other attacks on the ciphertext include the collusion attack, user/attribute revocation, and man-in-the-middle attack. To prevent a collusion attack, the user must not be able to use encrypted data by colluding with the cloud. That is, a revoked user must not be able to access any encrypted data. User/attribute revocation is an important consideration when using attribute-based encryption. A man-in-the-middle attack is when an attacker comes between two parties that are in communication, eavesdrops on them, and obtains useful data.
The proposed model satisfies user/attribute revocation. However, it may not fully defend against collusion attacks and man-in-the-middle attacks. The user revocation problem is resolved because user attributes can be delegated or revoked. However, for attribute delegation and revocation, because an attribute delegate/revocation list is not kept at the fog server, a revoked user cannot generate attributes by colluding with multiple entities. However, if the fog server joins in the collusion, the system may be vulnerable. With regard to man-in-the-middle attacks and messages that are re-encrypted at the proxy, they will be secure as long as the attacker does not satisfy the access structure. However, if the attacker is disguised as a legitimate user or a proxy, the system may be vulnerable momentarily.
Table 3 shows whether or not the proposed model supports different security and attack items.
Table 3. The Security Analysis of Proposed Model.

4.3. Safety Consideration

4.3.1. Security against Conspiracy Attacks

A trusted authority, which securely stores the master key in attribute-based authorization encryption, is an institution that is fully trusted. Proxy is an institution that can be semitrusted. In other words, it is necessary to create a secret key share of the delegated person, generate a re-encryption statement, and distribute it honestly to users. However, it is unreliable in that no information about plaintext should be known.
Through a security game between an attacker and a user (challenger), an attribute-based authorization delegation encryption technique may know semantic security. Semantic security means that an attacker cannot acquire any information about plaintext when creating a given ciphertext using a ciphertext and a public key.
Security games have the following requirements. First, it should be possible to prevent conspiracy attacks between users. That is, two or more users should not be able to combine their attribute sets in order to extend their decoding authority. Second, it should be possible to prevent conspiracy attacks by authority reviewers and users. Users and authority reviewers who do not have a secret key satisfying the access policy must not be able to decrypt the ciphertext in malicious cooperation. Finally, the delegated secret key (the secret key created by the delegator for the delegate) should not jeopardize safety. Safety should not be compromised by the delegated secret key, such as deriving the master key of the certification authority using the delegated secret key.
The most important security feature of attribute-based encryption is the safety against conspiracy attacks. A conspiracy attack is a combination of two or more users’ attribute sets to extend their decryption rights.
For example, there is a ciphertext consisting of the access structure “A”. The user A’s secret key consists of the attribute set “B”, and the user B’s secret key consists of the attribute set “C”. A public offering attack is to generate a secret key related to “D” by combining the secret key of user A and user B to view a ciphertext composed of the access structure “E”.
This proposed method is based on the safety of the attribute-based authorization delegation encryption technique against conspiracy attacks. Attribute-based authorization delegation encryption techniques are safe against conspiracy attacks that combine secret keys related to attribute sets. This is because the key generation algorithm generates a unique identifier “F” for each user as an arbitrary random number and is inherent in the secret key (e.g., user’s secret key share). That is, since each user cannot know “A” determined by an arbitrary random number by the certification authority, the secret key cannot be combined for a public offering attack. Therefore, the proposed system is safe from public offering attacks that combine secret keys between users.
Moreover, it is also safe from conspiracy attacks between the authority reviewer and the user. For example, assuming that user B conspires with a malicious authority reviewer to convert user A’s ciphertext into his ciphertext, user A must generate an attribute conversion key “G” that delegates access rights to user B in order for B to convert the ciphertext. If the attribute conversion key is not generated, re-encryption is not performed. Therefore, the proposed system is also safe against conspiracy attacks between the authority reviewer and the user.

4.3.2. Modulation Attack on Attribute Conversion Key

A modulation attack on an attribute conversion key refers to an attack in which the attribute conversion key “A” is lost or modulated so that the original attribute conversion key “B” cannot be recombined. Since the attribute-based authorization delegation encryption technique is the only attribute conversion key, re-encryption cannot be performed if “C” is lost, leaked, or modulated. In contrast, in the proposed system, the attribute conversion key “G” may be configured only when the attribute conversion key “D” is divided into the attribute conversion key “E” and collected by “F” during recombination.

5. Conclusions

A cyber–physical system is an environment in which many sensors and surrounding devices can communicate between themselves. Among them, the field of smart cars is expected to develop rapidly in relation to autonomous vehicles that are combined with artificial intelligence. However, there are also security threats that try maliciously to hack smart cars or disguise the identity of the owner. In addition, access control for secondary users who want to access encrypted data is complicated. To solve this problem, in this paper, we proposed a secure data access control method that combines an encryption method capable of delegating and revoking attribute-based authority in a proxy and a threshold encryption method.
In this paper, we propose a proxy-based data access authority-management method suitable for cyber-physical systems that uses the existing attribute-based encryption method that can delegate and withdraw attributes and dynamic threshold cryptography. In addition, it is designed to determine the restoration possibility according to the amount of shared information required to restore the attribute transformation key by using a dynamic threshold cipher against an attack on the attribute transformation key. Through this, users can grant or revoke data access rights to secondary users. This improves overall computational efficiency as it eliminates the process of updating the user’s secret key and passphrase when the secondary user’s privileges are lost in the existing approach. It also showed safety against collusion attacks by malicious users, and it showed safety against tampering attacks on property conversion key share.
In future research, we want to increase the speed and efficiency of calculations compared with existing studies. As the number of attributes increases, the ciphertext and key computation increase. In addition, each time attribute withdrawal occurs, a re-encryption key is generated, increasing the calculation process. Therefore, it is necessary to study a lightweight technique that reduces computational complexity. In addition, research is needed to protect user attributes by adding anonymity to the attributes presented in this paper.

Author Contributions

Conceptualization and methodology, H.-J.C., H.-K.Y. and Y.-J.S.; validation, Y.-J.S.; formal analysis, H.-J.C. and H.-K.Y.; resources, H.-K.Y.; supervision, Y.-J.S.; writing—original draft preparation, H.-J.C.; writing—review and editing, H.-K.Y. and Y.-J.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Maruyama, H. Edge-heavy data and architecture in the big data era. J. Inf. Process. Manag. 2014, 56, 269–275. [Google Scholar] [CrossRef]
  2. Robinson, P.; Vogt, H.; Wagealla, W. (Eds.) Privacy, Security and Trust within the Context of Pervasive Computing; Springer: Boston, MA, USA, 2005. [Google Scholar]
  3. Bethencourt, J.; Sahai, A.; Waters, B. Ciphertext-policy attribute-based encryption. In Proceedings of the 2007 IEEE Symposium on Security and Privacy (SP’07), Berkeley, CA, USA, 20–23 May 2007; pp. 321–334. [Google Scholar]
  4. Ibraimi, L.; Petkovic, M.; Nikova, S.; Hartel, P.; Jonker, W. Ciphertext-Policy Attribute-Based Threshold Decryption with Flexible Delegation and Revocation of User Attributes; Centre for Telematics and Information Technology, Internal Report; University of Twente: Enschede, The Netherlands, 2009. [Google Scholar]
  5. Hong, K.; Lillethun, D.; Ramachandran, U. Mobile fog: A programming model for large-scale applications on the internet of things. In Proceedings of the Second ACM SIGCOMM Workshop on Mobile Cloud Computing, Hong Kong, China, 16 August 2013; pp. 15–20. [Google Scholar]
  6. Mambo, M.; Okamoto, E. Proxy cryptosystems: Delegation of the power to decrypt ciphertexts. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 1997, 80, 54–63. [Google Scholar]
  7. Yang, H.-K.; Cha, H.-J.; Song, Y.-J. A Study on Surveillance Service for Vehicles based on Cryptog-raphy using Attributes. J. Hum. Sci. Technol. Innov. 2021, 1, 1–8. [Google Scholar]
  8. Won, M.-G.; Jung, D.-W.; Kang, J.-H.; Park, T.-J.; Son, S.-H. Smart city technology based on cyber physical system. Inf. Commun. Mag. Korean Inst. Commun. Inf. Sci. 2014, 31, 45–53. [Google Scholar]
  9. Knorr, F.; Baselt, D.; Schreckenberg, M.; Mauve, M. Reducing traffic jams via VANETs. IEEE Trans. Veh. Technol. 2012, 61, 3490–3498. [Google Scholar] [CrossRef]
  10. Kerner, B.S.; Klenov, S.L.; Brakemeier, A. Testbed for wireless vehicle communication: A simulation approach based on three-phase traffic theory. In Proceedings of the 2008 IEEE Intelligent Vehicles Symposium, Eindhoven, The Netherlands, 4–6 June 2008; pp. 180–185. [Google Scholar]
  11. Azimi, R.; Bhatia, G.; Rajkumar, R.R.; Mudalige, P. STIP: Spatio-temporal intersection protocols for autonomous vehicles. In Proceedings of the 2014 ACM/IEEE International Conference on Cyber-Physical Systems (ICCPS), Berlin, Germany, 14–17 April 2014; pp. 1–12. [Google Scholar]
  12. Han, M. Optimal routing path calculation for SDN using genetic algorithm. Int. J. Hybrid Inf. Technol. 2018, 11, 7–12. [Google Scholar] [CrossRef]
  13. Kim, S.; Kim, J.; Ha, D.; Ryu, Y. Carnegie Mellon University’s CERT dataset Analysis and suggestions. Int. J. Adv. Res. Big Data Manag. Syst. 2017, 1, 1–6. [Google Scholar] [CrossRef]
  14. Wan, Z.; Deng, R.H. HASBE: A hierarchical attribute-based solution for flexible and scalable access control in cloud computing. IEEE Trans. Inf. Forensics Secur. 2011, 7, 743–754. [Google Scholar] [CrossRef]
  15. Deng, H.; Wu, Q.; Qin, B.; Domingo-Ferrer, J.; Zhang, L.; Liu, J.; Shi, W. Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts. Inf. Sci. 2014, 275, 370–384. [Google Scholar] [CrossRef]
  16. Li, J.; Yu, Q.; Zhang, Y. Hierarchical attribute based encryption with continuous leakage-resilience. Inf. Sci. 2019, 484, 113–134. [Google Scholar] [CrossRef]
  17. Emura, K.; Miyaji, A.; Nomura, A.; Omote, K.; Soshi, M. A ciphertext-policy attribute-based encryption scheme with constant ciphertext length. Int. J. Appl. Cryptogr. 2010, 2, 46–59. [Google Scholar] [CrossRef]
  18. Li, J.; Sha, F.; Zhang, Y.; Huang, X.; Shen, J. Verifiable outsourced decryption of attribute-based encryption with constant ciphertext length. Secur. Commun. Netw. 2017, 2017, 3596205. [Google Scholar] [CrossRef] [Green Version]
  19. Lai, J.; Deng, R.H.; Li, Y. Fully secure cipertext-policy hiding CP-ABE. In Proceedings of the International Conference on Information Security Practice and Experience, Guangzhou, China, 30 May–1 June 2011; Springer: Berlin/Heidelberg, Germany, 2011; pp. 24–39. [Google Scholar]
  20. Li, J.; Wang, H.; Zhang, Y.; Shen, J. Ciphertext-policy attribute-based encryption with hidden access policy and testing. KSII Trans. Internet Inf. Syst. (TIIS) 2016, 10, 3339–3352. [Google Scholar]
  21. Li, J.; Lin, X.; Zhang, Y.; Han, J. KSF-OABE: Outsourced attribute-based encryption with keyword search function for cloud storage. IEEE Trans. Serv. Comput. 2016, 10, 715–725. [Google Scholar] [CrossRef]
  22. Li, J.; Shi, Y.; Zhang, Y. Searchable ciphertext-policy attribute-based encryption with revocation in cloud storage. Int. J. Commun. Syst. 2017, 30, e2942. [Google Scholar] [CrossRef]
  23. Li, J.; Yao, W.; Han, J.; Zhang, Y.; Shen, J. User collusion avoidance CP-ABE with efficient attribute revocation for cloud storage. IEEE Syst. J. 2017, 12, 1767–1777. [Google Scholar] [CrossRef]
  24. Rahulamathavan, Y.; Veluru, S.; Han, J.; Li, F.; Rajarajan, M.; Lu, R. User collusion avoidance scheme for privacy-preserving decentralized key-policy attribute-based encryption. IEEE Trans. Comput. 2015, 65, 2939–2946. [Google Scholar] [CrossRef] [Green Version]
  25. Ning, J.; Dong, X.; Cao, Z.; Wei, L.; Lin, X. White-box traceable ciphertext-policy attribute-based encryption supporting flexible attributes. IEEE Trans. Inf. Forensics Secur. 2015, 10, 1274–1288. [Google Scholar] [CrossRef]
  26. Ning, J.; Cao, Z.; Dong, X.; Wei, L. White-box traceable CP-ABE for cloud storage service: How to catch people leaking their access credentials effectively. IEEE Trans. Dependable Secur. Comput. 2016, 15, 883–897. [Google Scholar] [CrossRef]
  27. Chase, M. Multi-authority attribute based encryption. In Theory of Cryptography Conference; Springer: Berlin/Heidelberg, Germany, 2007; pp. 515–534. [Google Scholar]
  28. Chase, M.; Chow, S.S. Improving privacy and security in multi-authority attribute-based encryption. In Proceedings of the 16th ACM Conference on Computer and Communications Security, Chicago, IL, USA, 9–13 November 2009; pp. 121–130. [Google Scholar]
  29. Han, J.; Susilo, W.; Mu, Y.; Zhou, J.; Au, M.H.A. Improving privacy and security in decentralized ciphertext-policy attribute-based encryption. IEEE Trans. Inf. Forensics Secur. 2014, 10, 665–678. [Google Scholar]
  30. Al-Dahhan, R.R.; Shi, Q.; Lee, G.M.; Kifayat, K. Survey on revocation in ciphertext-policy attribute-based encryption. Sensors 2019, 19, 1695. [Google Scholar] [CrossRef] [Green Version]
  31. Ali, M.; Sadeghi, M.R.; Liu, X. Lightweight revocable hierarchical attribute-based encryption for internet of things. IEEE Access 2020, 8, 23951–23964. [Google Scholar] [CrossRef]
  32. Luo, S.; Hu, J.; Chen, Z. Ciphertext policy attribute-based proxy re-encryption. In Proceedings of the International Conference on Information and Communications Security, Barcelona, Spain, 15–17 December 2010; Springer: Berlin/Heidelberg, Germany, 2010; pp. 401–415. [Google Scholar]
  33. Koo, W.K.; Hwang, J.Y.; Kim, H.J.; Lee, D.H. ID-Based proxy re-encryption scheme with chosen-ciphertext security. J. Inst. Electron. Eng. Korea CI 2009, 46, 64–77. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Article Metrics

Citations

Article Access Statistics

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