@article {IOPORT.06035329,
    author       = {Bo\v{z}ovi\'c, Vladimir and Socek, Daniel and Steinwandt, Rainer and Vill\'anyi, Vikt\'oria I.},
    title        = {Multi-authority attribute-based encryption with honest-but-curious central authority.},
    year         = {2012},
    journal      = {International Journal of Computer Mathematics},
    volume       = {89},
    number       = {3},
    issn         = {0020-7160},
    pages        = {268-283},
    publisher    = {Taylor \& Francis, Abingdon},
    doi          = {10.1080/00207160.2011.555642},
    abstract     = {Summary: 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.},
    identifier   = {06035329},
}