International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption

Authors:
Venkata Koppula
Brent Waters
Download:
DOI: 10.1007/978-3-030-26951-7_23 (login may be required)
Search ePrint
Search Google
Abstract: We provide generic and black box transformations from any chosen plaintext secure Attribute-Based Encryption (ABE) or One-sided Predicate Encryption system into a chosen ciphertext secure system. Our transformation requires only the IND-CPA security of the original ABE scheme coupled with a pseudorandom generator (PRG) with a special security property.In particular, we consider a PRG with an n bit input s∈{0,1}n and n⋅ℓ bit output y1,…,yn where each yi is an ℓ bit string. Then for a randomly chosen s the following two distributions should be computationally indistinguishable. In the first distribution rsi,i=yi and rs¯i,i is chosen randomly for i∈[n]. In the second distribution all rb,i are chosen randomly for i∈[n],b∈{0,1}.We show that such PRGs can be built from either the computational Diffie-Hellman assumption (in non-bilinear groups) or the Learning with Errors (LWE) assumption (and potentially other assumptions). Thus, one can transform any IND-CPA secure system into a chosen ciphertext secure one by adding either assumption. (Or by simply assuming an existing PRG is hinting secure.) In addition, our work provides a new approach and perspective for obtaining chosen ciphertext security in the basic case of public key encryption.
Video from CRYPTO 2019
BibTeX
@article{crypto-2019-29902,
  title={Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption},
  booktitle={Advances in Cryptology – CRYPTO 2019},
  series={Lecture Notes in Computer Science},
  publisher={Springer},
  volume={11693},
  pages={671-700},
  doi={10.1007/978-3-030-26951-7_23},
  author={Venkata Koppula and Brent Waters},
  year=2019
}