UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Some bounds and a construction for secure broadcast encryption

Kurosawa, K; Yoshida, T; Desmedt, Y; Burmester, M; (1998) Some bounds and a construction for secure broadcast encryption. In: Ohta, K and Pei, D, (eds.) ADVANCES IN CRYPTOLOGY - ASIACRYPT'98. (pp. 420 - 433). SPRINGER-VERLAG BERLIN

Full text not available from this repository.

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 EIGamal cryptosystem. Vile 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.

Type:Proceedings paper
Title:Some bounds and a construction for secure broadcast encryption
Event:International Conference on the Theory and Application of Cryptology and Information Security
Location:BEIJING, PEOPLES R CHINA
Dates:1998-10-18 - 1998-10-22
ISBN:3-540-65109-8
UCL classification:UCL > School of BEAMS > Faculty of Engineering Science > Computer Science

Archive Staff Only: edit this record