A Novel User Revocation Scheme for Key Policy Attribute Based Encryption in Cloud Environments

2018 ◽  
Author(s):  
Yifan Ren ◽  
Jie Li ◽  
Yusheng Ji ◽  
Sajal K. Das ◽  
Zhetao Li
Keyword(s):  
Attribute Based Encryption ◽  
User Revocation ◽  
Key Policy ◽  
Cloud Environments

scholarly journals An Efficient Tate Pairing Algorithm for a Decentralized Key-Policy Attribute Based Encryption Scheme in Cloud Environments

Cryptography ◽  
2018 ◽  
Vol 2 (3) ◽  
pp. 14
Author(s):  
Balaji Chandrasekaran ◽  
Ramadoss Balakrishnan
Keyword(s):  
Computational Complexity ◽  
Bilinear Pairing ◽  
Base Number ◽  
Number Representation ◽  
Tate Pairing ◽  
User Privacy ◽  
Attribute Based Encryption ◽  
Key Policy ◽  
Cloud Environments ◽  
The Cost

Attribute-based encryption (ABE) is used for achieving data confidentiality and access control in cloud environments. Most often ABE schemes are constructed using bilinear pairing which has a higher computational complexity, making algorithms inefficient to some extent. The motivation of this paper is on achieving user privacy during the interaction with attribute authorities by improving the efficiency of ABE schemes in terms of computational complexity. As a result the aim of this paper is two-fold; firstly, to propose an efficient Tate pairing algorithm based on multi-base number representation system using point halving (TP-MBNR-PH) with bases 1/2, 3, and 5 to reduce the cost of bilinear pairing operations and, secondly, the TP-MBNR-PH algorithm is applied in decentralized KP-ABE to compare its computational costs for encryption and decryption with existing schemes.

Key-policy attribute-based encryption against continual auxiliary input leakage

2019 ◽  
Vol 470 ◽  
pp. 175-188 ◽  
Author(s):  
Jiguo Li ◽  
Qihong Yu ◽  
Yichen Zhang ◽  
Jian Shen
Keyword(s):  
Attribute Based Encryption ◽  
Key Policy ◽  
Auxiliary Input

Unbounded Key-Policy Attribute-Based Encryption With Black-Box Traceability

2020 ◽  
Author(s):  
yunxiu ye ◽  
Zhenfu Cao ◽  
Jiachen Shen
Keyword(s):  
Control Method ◽  
Black Box ◽  
Broadcast Encryption ◽  
Constant Number ◽  
Malicious User ◽  
Attribute Based Encryption ◽  
Key Policy ◽  
Actual Operation ◽  
Attribute Based Access Control ◽  
And Performance

Abstract Attribute-based encryption received widespread attention as soon as it proposes. However, due to its specific characteristics, the attribute-based access control method is not flexible enough in actual operation. In addition, since access authorities are determined according to users' attributes, users sharing the same attributes are difficult to distinguish. Once a malicious user makes illicit gains by their decryption authorities, it is difficult to trace specific users. This paper follows the practical demand to propose a more flexible key-policy attribute-based encryption scheme with black-box traceability. The scheme has a constant number of constant parameters which can be utilized to construct attribute-related parameters flexibly, and the method of traitor tracing in broadcast encryption is introduced to achieve effective malicious user tracing. In addition, the security and feasibility can be proved by the security proofs and performance evaluation in this paper.

scholarly journals Server-Aided Revocable Predicate Encryption: Formalization and Lattice-Based Instantiation

2019 ◽  
Vol 62 (12) ◽  
pp. 1849-1862
Author(s):  
San Ling ◽  
Khoa Nguyen ◽  
Huaxiong Wang ◽  
Juanyang Zhang
Keyword(s):  
Third Party ◽  
Fine Grained ◽  
Attribute Based Encryption ◽  
The Standard Model ◽  
User Revocation ◽  
Promising Solution ◽  
Identity Based ◽  
Role Based ◽  
Predicate Encryption ◽  
Learning With Errors Problem

Abstract Efficient user revocation is a necessary but challenging problem in many multi-user cryptosystems. Among known approaches, server-aided revocation yields a promising solution, because it allows to outsource the major workloads of system users to a computationally powerful third party, called the server, whose only requirement is to carry out the computations correctly. Such a revocation mechanism was considered in the settings of identity-based encryption and attribute-based encryption by Qin et al. (2015, ESORICS) and Cui et al. (2016, ESORICS ), respectively. In this work, we consider the server-aided revocation mechanism in the more elaborate setting of predicate encryption (PE). The latter, introduced by Katz et al. (2008, EUROCRYPT), provides fine-grained and role-based access to encrypted data and can be viewed as a generalization of identity-based and attribute-based encryption. Our contribution is 2-fold. First, we formalize the model of server-aided revocable PE (SR-PE), with rigorous definitions and security notions. Our model can be seen as a non-trivial adaptation of Cui et al.’s work into the PE context. Second, we put forward a lattice-based instantiation of SR-PE. The scheme employs the PE scheme of Agrawal et al. (2011, ASIACRYPT) and the complete subtree method of Naor et al. (2001, CRYPTO) as the two main ingredients, which work smoothly together thanks to a few additional techniques. Our scheme is proven secure in the standard model (in a selective manner), based on the hardness of the learning with errors problem.

scholarly journals Multi-authority Attribute-Based Encryption with User Revocation and Outsourcing Decryption

2019 ◽  
Vol 1302 ◽  
pp. 022026
Author(s):  
Xinyue Zhang ◽  
Yue Chen ◽  
Xincheng Yan ◽  
Hongyong Jia
Keyword(s):  
Attribute Based Encryption ◽  
User Revocation
Sign in / Sign up

Export Citation Format

Share Document