Abstract
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 cryptosystem. 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.
A part of this research has been supported by NSF Grant NCR-9508528.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blom, R.: An optimal class of symmetric key generation systems. Advances in Cryptology-EUROCRYPT’ 84, Lecture Notes in Computer Science #209. Springer-Verlag (1985) 335–338
Blundo, C., Cresti, A.: Space requirements for broadcast encryption, Advances in Cryptology-EUROCRYPT’ 94, Lecture Notes in Computer Science#950. Springer-Verlag (1995) 287–298.
Blundo, C., De Santis, A., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly secure key distribution for dynamic conferences, Advances in Cryptology-CRYPTO’ 92, Lecture Notes in Computer Science #740. Springer-Verlag (1993) 471–486
Blundo, C., Frota Mattos, L.A., Stinson, D.R.: Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution, Advances in Cryptology-CRYPTO’ 96, Lecture Notes in Computer Science #1109. Springer-Verlag (1996) 387–400
Fiat, A., Naor, M.: Broadcast encryption, Advances in Cryptology-CRYPTO’ 93, Lecture Notes in Computer Science #773. Springer-Verlag (1994) 480–491
D.R. Stinson, On some methods for unconditionally secure key distribution and broadcast encryption, Designs, Codes and Cryptography, 12 (1997) 215–243
Beimel, A., Chor, B.: Communication in key distribution schemes, IEEE Transactions on Information Theory, 42 (1996) 19–28
Ludy, M., Staddon, J.: Combinatorial bounds for broadcast encryption, Advances in Cryptology-EUROCRYPT’ 98, Lecture Notes in Computer Science #1403. Springer-Verlag (1998) 512–526
Desmedt, Y., Viswanathan, V.: Unconditionally secure dynamic conference key distribution, IEEE, ISIT’ 98 (1998)
Matsumoto, T., Imai, H.: On the key predistribution systems: A practical solution to the key distribution problem. In: Pomerance, C. (ed): Advances in Cryptology-CRYPTO’ 87, Lecture Notes in Computer Science #293. Springer-Verlag (1988) 185–193
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurosawa, K., Yoshida, T., Desmedt, Y., Burmester, M. (1998). Some Bounds and a Construction for Secure Broadcast Encryption. In: Ohta, K., Pei, D. (eds) Advances in Cryptology — ASIACRYPT’98. ASIACRYPT 1998. Lecture Notes in Computer Science, vol 1514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49649-1_33
Download citation
DOI: https://doi.org/10.1007/3-540-49649-1_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65109-3
Online ISBN: 978-3-540-49649-6
eBook Packages: Springer Book Archive