On key distribution via true broadcasting

Mike Just, Evangelos Kranakis, Danny Krizanc, Paul Van Oorschot

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

29 Citations (Scopus)


We consider true broadcast systems for the secure communication of session keys. These schemes provide for parallel rather than serial construction of broadcast messages, while avoiding selective broadcasting. We begin by introducing a conceptual framework for true broadcasting and illustrate its design with a secure key broadcast scheme based on probabilistic encryption. The framework provides for a system requiring user anonymity, as a result of the absence of addressing for the broadcast message. We also illustrate how Shamir’s threshold scheme can be altered to allow for parallel broadcasting. We then present a formal model and use information theoretic techniques to establish a lower bound on the size of the broadcast message for a class of true broadcast schemes. Finally, we improve upon the aforementioned threshold scheme such that it achieves the lower bound.
Original languageEnglish
Title of host publicationProceedings of the 2nd ACM Conference on Computer & Communications Security
EditorsDorothy Denning
Place of PublicationNew York (New York)
PublisherAssociation for Computing Machinery
Number of pages8
ISBN (Print)9780897917322
Publication statusPublished - Nov 1994
Event2nd ACM Conference on Computer & Communications Security - Fairfax, United States
Duration: 2 Nov 19944 Nov 1994

Publication series

NameProceedings of the ACM Conferences
PublisherAssociation for Computer Machinery


Conference2nd ACM Conference on Computer & Communications Security
Country/TerritoryUnited States


Dive into the research topics of 'On key distribution via true broadcasting'. Together they form a unique fingerprint.

Cite this