We first present two tight lower bounds on the size of the secret keys of each user in an unconditionally secure one-time use broadcast encryption scheme (OTBES). Then we show how to construct a computationally secure multiple-use broadcast encryption scheme (MBES) from a key predistribution scheme (KPS) by using the ElGamal cryp-tosystem. We prove that our MBES is secure against chosen (message, privileged subset of users) attacks if the ElGamal cryptosystem is secure and if the original KPS is simulatable. This is the first MBES whose security is proved formally.
CITATION STYLE
Kurosawa, K., Yoshida, T., Desmedt, Y., & Burmester, M. (1998). Some bounds and a construction for secure broadcast encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1514, pp. 420–433). Springer Verlag. https://doi.org/10.1007/3-540-49649-1_33
Mendeley helps you to discover research relevant for your work.