Multi-authority attribute-based encryption with honest-but-curious central authority
- 1 February 2012
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 89 (3) , 268-283
Abstract
An attribute-based encryption scheme capable of handling multiple authorities was recently proposed by Chase. The scheme is built upon a single-authority attribute-based encryption scheme presented earlier by Sahai and Waters. Chase's construction uses a trusted central authority that is inherently capable of decrypting arbitrary ciphertexts created within the system. We present a multi-authority attribute-based encryption scheme in which only the set of recipients defined by the encrypting party can decrypt a corresponding ciphertext. The central authority is viewed as ‘honest-but-curious’: on the one hand, it honestly follows the protocol, and on the other hand, it is curious to decrypt arbitrary ciphertexts thus violating the intent of the encrypting party. The proposed scheme, which like its predecessors relies on the Bilinear Diffie–Hellman assumption, has a complexity comparable to that of Chase's scheme. We prove that our scheme is secure in the selective ID model and can tolerate an honest-but-curious central authority.Keywords
This publication has 11 references indexed in Scilit:
- Multi-authority Attribute Based Encryption2007
- Efficient Identity-Based Encryption Without Random Oracles2005
- Fuzzy Identity-Based Encryption2005
- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles2004
- A Forward-Secure Public-Key Encryption Scheme2003
- An Identity Based Encryption Scheme Based on Quadratic Residues2001
- Identity-Based Encryption from the Weil Pairing2001
- Identity-Based Cryptosystems and Signature Schemes2000
- An ID-based cryptosystem based on the discrete logarithm problemIEEE Journal on Selected Areas in Communications, 1989
- A Realization Scheme for the Identity-Based CryptosystemLecture Notes in Computer Science, 1988