Cryptology ePrint Archive: Report 2012/216

Adaptive CCA Broadcast Encryption with Constant-Size Secret Keys and Ciphertexts

Duong-Hieu Phan and David Pointcheval and Siamak F. Shahandashti and Mario Strefler

Abstract: We consider designing broadcast encryption schemes with constant-size secret keys and ciphertexts, achieving chosen-ciphertext security. We first argue that known CPA-to-CCA transforms currently do not yield such schemes. We then propose a scheme, modifying a previous selective CPA secure proposal by Boneh, Gentry, and Waters. Our proposed scheme has constant-size secret keys and ciphertexts and we prove that it is selective chosen-ciphertext secure based on standard assumptions. Our scheme has ciphertexts that are shorter than those of the previous CCA secure proposals. Then we propose a second scheme that provides the functionality of both broadcast encryption and revocation schemes simultaneously using the same set of parameters. Finally we show that it is possible to prove our first scheme adaptive chosen-ciphertext secure under reasonable extensions of the bilinear Diffie-Hellman exponent and the knowledge of exponent assumptions. We prove both of these extended assumptions in the generic group model. Hence, our scheme becomes the first to achieve constant-size secret keys and ciphertexts (both asymptotically optimal) and adaptive chosen-ciphertext security at the same time.

Category / Keywords: public-key cryptography / Broadcast Encryption, Adaptive CCA Security, Revocation Scheme, GBDHE Assumption

Publication Info: ACISP 2012

Date: received 20 Apr 2012, last revised 23 Jul 2012

Contact author: siamak f s at gmail com

Available formats: PDF | BibTeX Citation

Version: 20120724:002945 (All versions of this report)

Discussion forum: Show discussion | Start new discussion