Browse by author
Lookup NU author(s): Dr Siamak Fayyaz Shahandashti
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
Author(s): Phan D-H, Pointcheval D, Shahandashti SF, Strefler M
Editor(s): Susilo, W; Mu, Y; Seberry, J
Publication type: Book Chapter
Publication status: Published
Book Title: Information Security and Privacy
Series Title: Lecture Notes in Computer Science
Place Published: Berlin
Library holdings: Search Newcastle University Library for this item