Efficient Revocation Mechanism Research Articles

Efficient Revocable Anonymous Authentication Mechanism for Edge Intelligent Controllers

In the field of industrial control, edge computing puts forward higher requirements for the local processing ability of data. The traditional industrial Programmable Logic Controller (PLC) cannot complete this task. Edge Intelligent Controller (EIC) is developed according to the demand for edge computing. As the core component of edge computing, the security and reliable operation of EIC has great significance and influence on the promotion and development of edge computing. For the access authentication of EIC, an efficient revocable anonymous authentication scheme for EICs by utilizing a group signature technique is proposed in this paper, which can trace the identity information of the EIC and protect the privacy of the EIC, and apply an efficient revocation mechanism to revoke any illegal or abnormal EICs. Through security analysis, we prove the authentication scheme is anonymity, integrity, traceability, forward secrecy, resistance to the replay attack and efficient revocability. Furthermore, the performance analysis and comparisons show that the authentication scheme is efficient and feasible for EICs.

ISC-CPPA:Improverd-Security Certificateless Conditional Privacy-Preserving Authentication Scheme With Revocation

With the development of Internet of Things, communication and computer technology, the significance of realizing vehicular ad hoc networks (VANETs) become more important. Due to wireless communication, VANETs suffer cyber attacks in practice. Many anonymous authentication schemes have been proposed in the literature. Li et al. proposed an efficient authentication scheme called CL-CPPA. However, the proposed scheme failed to realize the claimed un-linkability and anonymity. In this work, we proposed a new certificateless conditional privacy-preserving authentication scheme with an enhanced security guarantee. Specifically, a random number is selected to encrypt the unique tag to ensure anonymity. And our proposed scheme also realizes un-linkability, ensuring that attackers cannot determine whether different messages are sent by the same vehicle. Besides, we present a detailed and efficient revocation mechanism in the proposed scheme. Each RSU has its own private key, when there is a malicious vehicle, RSU will immediately update the private key of current area. Only legitimate vehicles can get the new private key, and malicious vehicle is efficiently revoked from the network. The experiment results show that the proposed scheme solves the above problems with little additional extra calculations.

Untouchable Once Revoking: A Practical and Secure Dynamic EHR Sharing System via Cloud

Healthcare Internet-of-Things (IoT) enables lightweight devices to observe patients’ vital signals and outsource them to a remote cloud to enjoy flexible data sharing. However, it faces many security threats as the outsourced data is no longer physically controlled by data owners, and the cloud that hosts the outsourced data is not fully trusted. Many privacy protection technologies have been adopted to solve this problem, among which cryptographic mechanisms have become one of the most promising tools. Unfortunately, current cryptographic mechanisms in healthcare IoT mainly suffer from the following challenges: 1) dynamic user groups for managing users’ accessibility; 2) efficient revocation mechanism to mitigate the burden during user revocation; 3) forward and backward secrecy to ensure session independence in the presence of session key leakage; 4) revocable storage to prevent data users from learning any unauthorized data even the data is authorized before; and 5) information manipulation during data transmission. In this article, we introduce a practical and secure system to address the above problems. Our system provides fine-grained access control with dynamic user groups for optimizing scalability and functionality. We prove that our system is secure against numerous real-world threats. Extensive comparison and experimental analysis demonstrate that our system enjoys superior performance than the state-of-the-art solutions.

Revocable attribute-based encryption from standard lattices

Attribute-based encryption (ABE) is an attractive extension of public key encryption, which provides fine-grained and role-based access to encrypted data. In its key-policy flavor, the secret key is associated with an access policy and the ciphertext is marked with a set of attributes. In many practical applications, and in order to address scenarios where users become malicious or their secret keys are compromised, it is necessary to design an efficient revocation mechanism for ABE. However, prior works on revocable key-policy ABE schemes are based on classical number-theoretic assumptions, which are vulnerable to quantum attacks. In this work, we propose the first revocable key-policy ABE scheme that offers an efficient revocation mechanism while maintaining fine-grained access control to encrypted data. Our scheme is based on the learning with errors (LWE) problem, which is widely believed to be quantum-resistant. Our scheme supports polynomial-depth policy function and has short secret keys, where the size of the keys depends only on the depth of the supported policy function. Furthermore, we prove that our scheme satisfies selective revocation list security in the standard model under the LWE assumption.

Enabling efficient traceable and revocable time-based data sharing in smart city

With the assistance of emerging techniques, such as cloud computing, fog computing and Internet of Things (IoT), smart city is developing rapidly into a novel and well-accepted service pattern these days. The trend also facilitates numerous relevant applications, e.g., smart health care, smart office, smart campus, etc., and drives the urgent demand for data sharing. However, this brings many concerns on data security as there is more private and sensitive information contained in the data of smart city applications. It may incur disastrous consequences if the shared data are illegally accessed, which necessitates an efficient data access control scheme for data sharing in smart city applications with resource-poor user terminals. To this end, we proposes an efficient traceable and revocable time-based CP-ABE (TR-TABE) scheme which can achieve time-based and fine-grained data access control over large attribute universe for data sharing in large-scale smart city applications. To trace and punish the malicious users that intentionally leak their keys to pursue illicit profits, we design an efficient user tracing and revocation mechanism with forward and backward security. For efficiency improvement, we integrate outsourced decryption and verify the correctness of its result. The proposed scheme is proved secure with formal security proof and is demonstrated to be practical for data sharing in smart city applications with extensive performance evaluation.

Revocable attribute-based proxy re-encryption

Abstract Attribute-based proxy re-encryption (ABPRE), which combines the notions of proxy re-encryption (PRE) and attribute-based encryption (ABE), allows a semi-trusted proxy with re-encryption key to transform a ciphertext under a particular access policy into a ciphertext under another access policy, without revealing any information about the underlying plaintext. This primitive is very useful in applications where encrypted data need to be stored in untrusted environments, such as cloud storage. In many practical applications, and in order to address scenarios where users misbehave or the re-encryption keys are compromised, an efficient revocation mechanism is necessary for ABPRE. Previously, revocation mechanism was considered in the settings of identity-based encryption (IBE), ABE, predicate encryption (PE), and broadcast PRE, but not ABPRE, which is what we set to do in this paper. We first formalize the concept of revocable ABPRE and its security model. Then, we propose a lattice-based instantiation of revocable ABPRE. Our scheme not only supports an efficient revocation mechanism but also supports polynomial-depth policy circuits and has short private keys, where the size of the keys is dependent only on the depth of the supported policy circuits. In addition, we prove that our scheme is selectively chosen-plaintext attack (CPA) secure in the standard model, based on the learning with errors assumption.

Computationally efficient and secure anonymous authentication scheme for cloud users

In cloud computing, the combinations of various computing units are globally separated, however, electronically connected. In recent years, the number of cloud users has adequately increased in the modern societies. In order to restrict the illegal access of the intruders, a strong user authentication is required for cloud computing environment. In this regard, in this paper, we came up with a computationally productive and safer anonymous authentication pattern for cloud users. Moreover, in our scheme, mutual authentication is performed in an anonymous way between the cloud user and the cloud server to strongly verify the legitimacy of each user before providing an access into the cloud. After the successful anonymous mutual authentication, the targeted cloud service provider and the cloud users make mutual communication between them. In case of any misbehaviouring after successful mutual authentication, an efficient revocation mechanism is proposed through which the trusted third party (TTP) can revoke the cloud users or service providers from the cloud environment. Even though there were many anonymous cloud computing authentication schemes, the previously proposed authentication schemes suffered from high computational cost during certificate verification. Moreover, the section related to analysis proves that the explained scheme is robust enough in terms of security strength to avoid various security attacks and breeches.

Practical Multiauthority Attribute-Based Access Control for Edge-Cloud-Aided Internet of Things

With the assistance of edge computing which reduces the heavy burden of the cloud center server by using the network edge servers, the Internet of Things (IoTs) architectures enable low latency for real-time devices and applications. However, there still exist security challenges on data access control for the IoT. Multiauthority attribute-based encryption (MA-ABE) is a promising technique to achieve access control over encrypted data in cross-domain applications. Based on the characteristics and technical requirements of the IoT, we propose an efficient fine-grained revocable large universe multiauthority access control scheme. In the proposed scheme, the most expensive encryption operations have been executed in the user’s initialization phase by adding a reusable ciphertext pool besides splitting the encryption algorithm to online encryption and offline encryption. Massive decryption operations are outsourced to the near-edge servers for reducing the computation overhead of decryption. An efficient revocation mechanism is designed to change users’ access privileges dynamically. Moreover, the scheme supports ciphertext verification. Only valid ciphertext can be stored and transmitted, which saves system resources. With the help of the chameleon hash function, the proposed scheme is proven CCA2-secure under the q-DPBDHE2 assumption. The performance analysis results indicate that the proposed scheme is efficient and suitable in edge computing for the IoT.

A Leakage-Resilient ID-Based Authenticated Key Exchange Protocol With a Revocation Mechanism

Establishing a session key (SSK) is very important for real-world deployment in open networks, which enables secure communication between remote parties. In the past, some authenticated key exchange (AKE) protocols have been proposed to generate a SSK, but the certificate management issue is inhered in the traditional public key infrastructure and must be addressed. To tackle this issue, the identity (ID)-based concept is added to AKE, called ID-AKE. Indeed, the security of the existing AKE/ID-AKE protocols is gaining increasing importance due to some new types of attacks, namely, side-channel attacks. In such attacks, adversaries could obtain secret keys’ partial information during the execution of cryptographic protocols (including AKE/ID-AKE). To withstand such attacks, many leakage-resilient ID-AKE (LR-ID-AKE) protocols resisting side-channel attacks have been proposed. However, these existing LR-ID-AKE protocols have no efficient solution to revoke compromised users. In this article, the first LR-ID-AKE protocol with an efficient revocation mechanism, called LR-RID-AKE, is proposed. The proposed protocol is not only as secure as existing LR-ID-AKE protocols but also able to efficiently revoke compromised users from the system.

Server-aided immediate and robust user revocation mechanism for SM9

As the only approved Identity-Based Encryption scheme in China that is also standardized by ISO, SM9-IBE has been widely adopted in many real-world applications. However, similar to other IBE standard algorithms, SM9-IBE currently lacks revocation mechanism, which is vital for a real system. Worse still, we find that existing revocable techniques may not be suitable and efficient when applying to SM9-IBE. Given the widespread use of SM9-IBE, an efficient and robust user revocation mechanism becomes an urgent issue.In this work, we propose a dedicated server-aided revocation mechanism, which for the first time achieves the secure, immediate and robust user revocation for SM9-IBE. Provided with a compact system model, the proposed method leverages an existing server to perform all heavy workloads during user revocation, thus leaving no communication and computation costs for the key generation center and users. Moreover, the mechanism supports key-exposure resistance, meaning the user revocation mechanism is robust even if the revocation key leaks. We then formally define and prove the security. At last, we present theoretical comparisons and an implementation in terms of computational latency and throughput. The results indicate the efficiency and practicability of the proposed mechanism.

Scalable revocable identity-based signature over lattices in the standard model

Revocable identity based signature (RIBS) is a useful cryptographic primitive, which provides a revocation mechanism to revoke misbehaving or malicious users over ID-based public key settings. In the past, many RIBS schemes have been previously proposed, but the security of all these existing schemes is based on traditional complexity assumptions, which are not secure against attacks in the quantum era. Lattice-based cryptography has many attractive features and it is all believed to be secure against attacks of quantum computing. Recently, Hung et al. proposed a RIBS with short size over lattices. However, in their scheme, it requires the private key generator (PKG) to perform linear work in the number of users and does not scale well. Moreover, their scheme is secure in the random oracle model. In this paper, we adopt the binary tree structure to present a scalable lattice-based RIBS scheme which greatly reduces the PKG’S workload associated with users from linear to logarithm. We prove that our proposed scheme is existentially unforgeable against chosen message attacks (EUF-CMA) under standard short integer solutions (SIS) assumption, in the standard model. Compared with the existing RIBS schemes over lattices, our proposed RIBS construction is secure in the standard model with scalability and meanwhile has efficient revocation mechanism with public channels.

Certificate Revocation Schemes in Vehicular Networks: A Survey

The problem of security in vehicular networks is a vital issue and attracts researchers' increasing attention for its unique characteristics, such as the vulnerability of wireless media, untrusted communication environment, and closely relationship with human lives and privacy. Authentication is an effective means to ensure the security of communication and provide trust. Authorized vehicle should be revoked if the vehicle become compromised. Designing an efficient revocation mechanism for vehicular networks is a challenging task because of the diverse security requirements and the unique network characteristics. Thus, a large body of work emerged in recent years, proposing revocation schemes tailored to vehicular networks. In this paper, we provide a comprehensive survey on revocation schemes in vehicular networks. Firstly, we investigate existing revocation schemes systematically and classify these schemes based on the location where the revocation information has been placed. Secondly, we divide the whole revocation process into three stages: 1) the resolution of revocation information, 2) the distribution of revocation information and 3) the use of revocation information. Typical works in each stage of the revocation process have been reviewed and we also point out the challenging problems and key enabled techniques in each stage.

A lightweight privacy-preserving data aggregation scheme with provable security for internet-of-things

In this work, an autonomous lightweight certificateless aggregate signature-based data aggregation scheme for internet-of-things (IoT) is proposed. In the scheme, IoT terminals only need to contact the key generation center (KGC) once. Subsequently, they can generate their pseudonyms on their own without any interaction with the KGC. An efficient revocation mechanism is provided to punish malicious terminals. The proposed scheme is anonymous, can provide conditional traceability, resist various attacks, and solves private key compromise problem. The formal security proof demonstrates that the scheme is secure against both Type I and Type II adversaries in the random oracle model based on the intractability of the Discrete Logarithm Problem. The performance evaluation shows that the proposed scheme is more efficient than the state-of-the-art schemes and fits the resource-constraint IoT environment.

DoS-Resistant Attribute-Based Encryption in Mobile Cloud Computing with Revocation

Security and privacy are very important challenges for outsourced private data over cloud storages. By taking Attribute-Based Encryption (ABE) for Access Control (AC) purpose we use fine-grained AC over cloud storage. In this paper, we extend previous Ciphertext Policy ABE (CP-ABE) schemes especially for mobile and resource-constrained devices in a cloud computing environment in two aspects, a novel authentication mechanism and a new revocation approach. To wide-spread adoptions of ABE for a resource-constrained device, a very light-weight authentication mechanism is required to authentication ciphertext before starting cost expensive ABE techniques to thwart Denial-of-Service (DoS) attacks which are used to power depletion and network downing purposes by attackers. We introduce and address the problem to more robustness of whole networks when DoS attacks are present. Moreover, we propose an efficient revocation mechanism which is a very important challenge in the context. Finally with a discussion on different aspects of the proposal and extensive experimental results we show its profitability.

Efficient Ciphertext-Policy Attribute-Based Online/Offline Encryption with User Revocation

Attribute-Based Encryption (ABE) must provide an efficient revocation mechanism since a user’s private key can be compromised or expired over time. The existing revocable ABE schemes have the drawbacks of heavy computational costs on key updates and encryption operations, which make the entities for performing these operations a possible bottleneck in practice applications. In this paper, we propose an efficient Ciphertext-Policy Attribute-Based Online/Offline Encryption with user Revocation (R-CP-ABOOE). We integrate the subset difference method with ciphertext-policy ABE to significantly improve key-update efficiency on the side of the trusted party from O(rlog⁡(N/r)) to O(r), where N is the number of users and r is the number of revoked users. To reduce the encryption burden for mobile devices, we use the online/offline technology to shift the majority of encryption work to the offline phase, and then mobile devices only need to execute a few simple computations to create a ciphertext. In addition, we exploit a novel trick to prove its selective security under the q-type assumption. Performance analysis shows that our scheme greatly improves the key-update efficiency for the trusted party and the encryption efficiency for mobile devices.

Communication-efficient revocable identity-based signature from multilinear maps

An efficient revocation mechanism is absolutely necessary for a cryptosystem with a large number of users to strengthen the system security. Besides the integrity and authentication of messages, a revocable identity-based signature scheme also provides a public way to remove those users whose credentials are expired or whose private keys are compromised from the system. In the existing revocable identity-based signature schemes, the workload of the authority performing the revocation procedure is linear or logarithmic in the number of non-revoked users, which decrease its usability in many practical scenarios (e.g., ad hoc networks) that are sensitive of bandwidth. In this study, we propose the first revocable identity-based signature scheme with constant sizes of private key, update key and signature by using multilinear maps. The security of the proposed scheme is proven in the selective-revocation list and adaptive-message setting, without random oracles. Performance discussions show that our scheme owns advantages in terms of functionality and efficiency.

Attribute-based cloud storage with secure provenance over encrypted data

To securely and conveniently enjoy the benefits of cloud storage, it is desirable to design a cloud data storage system which protects data privacy from storage servers through encryption, allows fine-grained access control such that data providers can expressively specify who are eligible to access the encrypted data, enables dynamic user management such that the total number of data users is unbounded and user revocation can be carried out conveniently, supports data provider anonymity and traceability such that a data provider’s identity is not disclosed to data users in normal circumstances but can be traced by a trusted authority if necessary, and equally important, provides secure data provenance by presenting irrefutable evidence on who has created and modified the data in the cloud. However, most of the existing cloud storage systems with secure provenance either lack the expressiveness in access control or incur too much performance overhead or do not support dynamic user management. In this paper, we solve these problems by presenting an attribute-based cloud storage system with secure provenance. We first give a simple construction without achieving user revocation, and then extend it with an efficient revocation mechanism to prevent revoked data users from accessing the newly encrypted data. Thereafter, we implement the algorithms in the proposed two constructions to evaluate their performance. Our experimental results show that the proposed systems are acceptable to be applied in practice.

Efficient revocable identity-based encryption via subset difference methods

Providing an efficient revocation mechanism for identity-based encryption (IBE) is very important since a user's credential (or private key) can be expired or revealed. revocable IBE (RIBE) is an extension of IBE that provides an efficient revocation mechanism. Previous RIBE schemes essentially use the complete subtree (CS) scheme of Naor, Naor and Lotspiech (CRYPTO 2001) for key revocation. In this paper, we present a new technique for RIBE that uses the efficient subset difference (SD) scheme of Naor et al. instead of using the CS scheme to improve the size of update keys. Following our new technique, we first propose an efficient RIBE scheme in prime-order bilinear groups by combining the IBE scheme of Boneh and Boyen and the SD scheme and prove its selective security under the standard assumption. Our RIBE scheme is the first RIBE scheme in bilinear groups that has O(r) number of group elements in an update key where r is the number of revoked users. Next, we also propose another RIBE scheme in composite-order bilinear groups and prove its full security under static assumptions. Our RIBE schemes also can be integrated with the layered subset difference scheme of Halevy and Shamir (CRYPTO 2002) to reduce the size of a private key.

Integrating the Functional Encryption and Proxy Re-cryptography to Secure DRM Scheme

The current Digital Rights Management (DRM) systems use attribute-based encryption (ABE) and proxy re-encryption (PRE) to achieve fine-grained access control in cloud computing. However, these schemes have some limitations particularly in terms of security, functionality and also higher decryption time which grows linearly with the complexity of access policies. In this paper, we propose a novel DRM scheme founded on a deterministic finite automata-based functional proxy re-encryption (DFA-based FPRE) scheme which has been proven to be secure against CCA in the standard model. In particular, we leverage the DFA-based FPRE scheme to realize fine-grained access control over encrypted contents among a set of users. Furthermore, a secure content key distribution protocol and efficient revocation mechanism are provided. Moreover, we tackle the critical issue of high computation at the user side, by outsourcing computation into (DFA-based FPRE) scheme for the first time. In comparison, our scheme achieves higher efficiency and smaller computation time against state-of-the-art.

List-Free ID-Based Mutual Authentication and Key Agreement Protocol for Multiserver Architectures

A multiserver architecture consisting of multiple servers provides resources and services for clients by way of open channels. Thus, a cryptographic protocol should be offered to ensure the legitimacy of both clients and servers, and to provide communication confidentiality. In the past, a large number of ID-based mutual authentication and key agreement (ID-MAKA) protocols have been proposed regarding this issue. Several circumstances require a revocation mechanism to revoke misbehaving/compromised clients and servers before their intended expiration dates. To do so, the existing ID-MAKA protocols generally adopt a black/white list to revoke/permit clients for access authorization. So far, no work addresses the revocation problem on servers in the sense that clients should be notified to avoid malicious services or applications provided by revoked servers. In this letter, we propose the first list-free ID-MAKA protocol with an efficient revocation mechanism for multiserver architectures. Compared with previously proposed protocols, our protocol possesses three main merits. First, it provides a simple revocation mechanism to solve the management problem of both compromised clients and servers. Second, neither clients nor servers need to keep any black/white list. Finally, it is well suitable for mobile clients by performance analysis and experimental data.