CABE: A New Comparable Attribute-Based Encryption Construction with 0-Encoding and 1-Encoding
Authors:
- 12 April 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 66 (9) , 1491-1503
Abstract
Attribute-based encryption (ABE) has opened up a popular research topic in cryptography over the past few years. It can be used in various circumstances, as it provides a flexible way to conduct fine-grained data access control. Despite its great advantages in data access control, current ABE based access control system cannot satisfy the requirement well when the system judges the access behavior according to attribute comparison, such as “greater than x” or “less than x”, which are called comparable attributes in this paper. In this paper, based on a set of well-designed sub-attributes representing each comparable attribute, we construct a comparable attribute-based encryption scheme (CABE for short) to address the aforementioned problem. The novelty lies in that we provide a more efficient construction based on the generation and management of the sub-attributes with the notion of 0-encoding and 1-encoding. Extensive analysis shows that: Compared with the existing schemes, our scheme drastically decreases the storage, communication and computation overheads, and thus is more efficient in dealing with the applications with comparable attributes.Keywords
Funding Information
- National Natural Science Foundation of China (61379129, 61671420)
- Youth Innovation Promotion Association CAS
- Fundamental Research Funds for the Central Universities
This publication has 34 references indexed in Scilit:
- Securely Outsourcing Attribute-Based Encryption with CheckabilityIEEE Transactions on Parallel and Distributed Systems, 2013
- Design and implementation of a confidentiality and access control solution for publish/subscribe systemsComputer Networks, 2012
- Efficient Ciphertext Policy Attribute-Based Encryption with Constant-Size Ciphertext and Constant Computation-Cost2011
- Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts2011
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization2011
- How to Construct Interval Encryption from Binary Tree Encryption2010
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products2008
- Conjunctive, Subset, and Range Queries on Encrypted Data2007
- Multi-authority Attribute Based Encryption2007
- An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption2005