Privacy-Preserving Decentralized Key-Policy Attribute-Based Encryption Schemes with Fast Decryption
We present an efficient decentralized Attribute-Based Encryption (ABE) that supports any Monotone Access Structure (MAS) with faster decryption capability in the key-policy setting. We further extend our MAS construction to Non-Monotone Access Structure (nonMAS) in order to support negative attributes. A notable advantage of our nonMAS construction is that the computation cost during encryption and decryption, and the size of ciphertext are linear to the number of authorities involved in the system, not to the number of attributes used in the respective process unlike existing schemes. In addition, our schemes provide user privacy, enabling any user to obtain secret keys without disclosing its unique identity to the authorities. The security reduction of both the schemes rely on the decisional Bilinear Diffie-Hellman Exponent problem.
KeywordsKey-policy Decentralized Attribute-Based User privacy
The authors would like to thank the anonymous reviewers of this paper for their valuable comments and suggestions.
- 1.Chase, M., Chow, S.S.M.: Improving privacy and security in multi-authority attribute-based encryption. In: ACM Conference on Computer and Communications Security, pp. 121–130. ACM, New York (2009)Google Scholar
- 5.Li, Q.Y., Xiong, H., Zhang, F.L., Zeng, S.K.: An expressive decentralizing KP-ABE scheme with constant-size ciphertext. Int. J. Netw. Secur. 15(3), 131–140 (2013)Google Scholar