检索结果-南通市图书馆

Generic attribute revocation systems for attribute-based encryption in cloud storage

在线全文

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2019年第6期20卷 773-786页

作者： Genlang CHEN Zhiqian XU Jia-jian ZHANG Guo-jun WANG Hai JIANG Miao-qing HUANG Institute of Ningbo Technology Zhejiang University Ningbo 315100 China Ningbo Research Institute Zhejiang University Ningbo 315100 China Independent Scholar School of Computer Science and Technology Guangzhou University Guangzhou 510006 China Department of Computer Science Arkansas State University Jonesboro 72467 USA Department of Computer Science and Computer Engineering University of Arkansas Jonesboro 72467 USA

Attribute-based encryption(ABE) has been a preferred encryption technology to solve the problems of data protection and access control, especially when the cloud storage is provided by third-party service providers.ABE can put data access under control at each data item level. However, ABE schemes have practical limitations on dynamic attribute revocation. We propose a generic attribute revocation system for ABE with user privacy protection. The attribute revocation ABE(AR-ABE) system can work with any type of ABE scheme to dynamically revoke any number of attributes.

关键词： Attribute-based encryption Generic attribute revocation User privacy Cloud storage Access control

An Efficient Broadcast Encryption Supporting Designation and revocation Mechanisms

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2019年第3期28卷 445-456页

作者： ZHU Yan YU Ruyun CHEN E HUANG Dijiang School of Computer and Communication Engineering University of Science and Technology Beijing School of Computing Informatics and Decision System Engineering Arizona State University

In this paper our objective is to explore approaches of secure group-oriented communication with designation and revocation mechanisms simultaneously.We present a new scheme of revocation-based broadcast encryption(RBBE) which is designed on Dan Boneh et al.’s scheme with the designation mechanism proposed in 2005. We combine two above-mentioned schemes into a new cryptosystem, called Dual-mode broadcast encryption(DMBE). Based on these work, we reach the following conclusions. We use the DMBE scheme as an example to show that it is feasible to construct a broadcast encryption scheme that supports designation and revocation mechanisms simultaneously. The cryptosystem with dual modes is more efficient than that with single mode over computational costs, and the performance is improved to at most O(「N/2」), where N is the total number of users in the system. We prove completely that both the RBBE scheme and the DMBE scheme are semantically secure against chosen plaintext attack with full collusion under the decisional bilinear Diffie-Hellman exponent assumption.

关键词： Cryptography Broadcast encryption Provable security revocation Designation Dual modes

Generic user revocation systems for attribute-based encryption in cloud storage

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2018年第11期19卷 1362-1384页

作者： Genlang CHEN Zhiqian XU Hai JIANG Kuan-ching LI Institute of Ningbo Technology Zhejiang University Independent Scholar Department of Computer Science Arkansas State University Department of Computer Science and Information Engineering Providence University

Cloud-based storage is a service model for businesses and individual users that involves paid or free storage resources. This service model enables on-demand storage capacity and management to users anywhere via the Internet. Because most cloud storage is provided by third-party service providers, the trust required for the cloud storage providers and the shared multi-tenant environment present special challenges for data protection and access control. Attribute-based encryption(ABE) not only protects data secrecy, but also has ciphertexts or decryption keys associated with fine-grained access policies that are automatically enforced during the decryption process. This enforcement puts data access under control at each data item level. However, ABE schemes have practical limitations on dynamic user revocation. In this paper, we propose two generic user revocation systems for ABE with user privacy protection, user revocation via ciphertext re-encryption(UR-CRE) and user revocation via cloud storage providers(UR-CSP), which work with any type of ABE scheme to dynamically revoke users.

关键词： Attribute-based.encryption Generic user revocation User privacy Cloud storage Access control

Method of secure, scalable, and fine-grained data access control with efficient revocation in untrusted cloud

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2015年第2期22卷 38-43页

作者： Song Lingwei Yu Fang Zhang Ru Niu Xinxin Information Security Center Beijing University of Posts and Telecommunications

Cloud computing is a developing computing paradigm in which resources of the computing infrastructure are provided as services over the network. Hopeful as it is, this paradigm also brings new challenges for data security and encryption storage when date owner stores sensitive data for sharing with untrusted cloud servers. When it comes to fine-grained data and scalable access control, a huge computation for key distribution and data management is required. In this article, we achieved this goal by exploiting and uniquely combining techniques of ciphertext-policy attribute-based encryption （CP-ABE）, linear secret sharing schemes （LSSS）, and counter （CTR） mode encryption. The proposed scheme is highly efficient by conducting the revocation on attribute level rather than on user level. The goals of data confidentiality and no collusion attack （even the cloud servers （CS） collude with users）, as well as ones of fine-grainedness and scalability, are also achieved in our access structure.

关键词： CP-ABE revocation fine-grained counter mode encryption cloud computing

Provably Secure Role-Based Encryption with revocation Mechanism

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2011年第4期26卷 697-710页

作者：朱岩胡宏新 Gail-Joon Ahn 王怀习王善标 Institute of Computer Science and Technology Peking University Beijing Key Laboratory of Internet Security Technology Peking University School of Computing Informatics and Decision Systems EngineeringArizona State University School of Mathematical Sciences Peking University

Role-Based Encryption （RBE） realizes access control mechanisms over encrypted data according to the widely adopted hierarchical RBAC model. In this paper, we present a practical RBE scheme with revocation mechanism based on partial-order key hierarchy with respect to the public key infrastructure, in which each user is assigned with a unique private-key to support user identification, and each role corresponds to a public group-key that is used to encrypt data. Based on this key hierarchy structure, our RBE scheme allows a sender to directly specify a role for encrypting data, which can be decrypted by all senior roles, as well as to revoke any subgroup of users and roles. We give a full proof of security of our scheme against hierarchical collusion attacks. In contrast to the existing solutions for encrypted file systems, our scheme not only supports dynamic joining and revoking users, but also has shorter ciphertexts and constant-size decryption keys.

关键词： cryptography role-based encryption role hierarchy key hierarchy collusion security revocation

A revocation SCHEME FOR THE CLOUD COMPUTING ENVIRONMENT

在线全文

学校读者我要写书评

暂无评论

A REVOCATION SCHEME FOR THE CLOUD COMPUTING ENVIRONMENT

Attribute-Based Secure Data Sharing with Efficient revocation in Fog Computing

2011 IEEE International Conference on Cloud Computing and Intelligence Systems(CCIS2011)

作者： Xiaobiao Li,Qiaoyan Wen State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing,China

In order to meet the authentication requirement of the revoking frequently and dynamic network environment,a revocation scheme for the cloud computing environment is proposed.The entering,leaving,revoking and authentication of entities are implemented based on the public key cryptography and the secure dynamic one-way accumulator,and the cross-domain property is also supported.The results show that the proposed scheme is provable secure to realize the identity authentication,session key agreement and key update with entity secrecy and perfect forward secrecy etc.In the cloud computing environment,compared with the existing schemes,this solution has a higher level of security,better performance and more comprehensive problem solving for revocation.

关键词： cloud computing revocation authentication cross-domain

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Information Security 2017年第3期8卷 203-222页

作者： Asma Alotaibi Ahmed Barnawi Mohammed Buhari Department of Information Technology King Abdulaziz University Jeddah Saudi Arabia

Fog computing is a concept that extends the paradigm of cloud computing to the network edge. The goal of fog computing is to situate resources in the vicinity of end users. As with cloud computing, fog computing provides storage services. The data owners can store their confidential data in many fog nodes, which could cause more challenges for data sharing security. In this paper, we present a novel architecture for data sharing in a fog environment. We explore the benefits of fog computing in addressing one-to-many data sharing applications. This architecture sought to outperform the cloud-based architecture and to ensure further enhancements to system performance, especially from the perspective of security. We will address the security challenges of data sharing, such as fine-grained access control, data confidentiality, collusion resistance, scalability, and the issue of user revocation. Keeping these issues in mind, we will secure data sharing in fog computing by combining attributebased encryption and proxy re-encryption techniques. Findings of this study indicate that our system has the response and processing time faster than classical cloud systems. Further, experimental results show that our system has an efficient user revocation mechanism, and that it provides high scalability and sharing of data in real time with low latency.

关键词： Attribute-Based Encryption Fine-Grained Access Control Fog Computing Proxy Re-Encryption User revocation

Tree-Based revocation for Certificateless Authentication in Vehicular Ad-Hoc Networks

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer and Communications 2014年第9期2卷 14-21页

作者： Pino Caballero-Gil Francisco Martín-Fernández Cándido Caballero-Gil Department of Computer Science University of La Laguna Tenerife Spain

This work proposes authentication based on identity as a way to increase the efficiency and security of communications in vehicular ad-hoc networks. When using identity-based cryptography to achieve certificateless authentication, membership revocation is not a trivial problem. Thus, in order to improve the performance of revocation in such networks, the use of a dynamic authenticated data structure based on perfect k-ary hash trees combined with a duplex version of the new standard SHA-3 is here presented. Efficient algorithms in the used revocation trees allow reaching a refresh rate of at most simple updates per inserted node. Consequently, the proposal is especially useful for situations with frequent revocations, which are foreseeable when vehicular ad- hoc networks are widely deployed.

关键词： K-Ary Tree Identity-Based Cryptography revocation Hash Function Vehicular Ad-Hoc Network

Revocable Hierarchical Identity-Based Broadcast Encryption

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2018年第5期23卷 539-549页

作者： Dawei Li Jianwei Liu Zongyang Zhang Qianhong Wu Weiran Liu School of Electronic and Information Engineering Beihang University Beijing 100191 China

Hierarchical Identity-Based Broadcast Encryption （HIBBE） organizes users into a tree-like structure, and it allows users to delegate their decryption ability to subordinates and enable encryption to any subset of users while only intended users can decrypt. However, current HIBBE schemes do not support efficient revocation of private keys. Here, a new primitive called Revocable Hierarchical Identity-Based Broadcast Encryption （RHIBBE） is formalized that allows revocation of the HIBBE. Ciphertext indistinguishability is defined against the selectively Bounded Revocable Identity-Vector-Set and Chosen-Plaintext Attack （IND-sBRIVS-CPA）. An IND-sBRIVS-CPA secure RHIBBE scheme is constructed with efficient revocation on prime-order bilinear groups. The unbounded version of the scheme is also shown to be secure but a little weaker than the former under the decisional n-Weak Bilinear Diffie-Hellman inversion assumption.

关键词： Revocable Hierarchical Identity-Based Broadcast Encryption （RHIBBE） revocation provable security