On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
 Doug R. Stinson
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
This paper provides an exposition of methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified key or decrypt the broadcast message. Moreover, this is done in such a way that no coalition is able to recover any information on a key or broadcast message they are not supposed to know. The problems are studied using the tools of information theory, so the security provided is unconditional (i.e., not based on any computational assumption).
We begin by surveying some useful schemes for key distribution that have been presented in the literature, giving background and examples (but not too many proofs). In particular, we look more closely at the attractive concept of key distribution patterns, and present a new method for making these schemes more efficient through the use of resilient functions. Then we present a general approach to the construction of broadcast schemes that combines key predistribution schemes with secret sharing schemes. We discuss the FiatNaor Broadcast Scheme, as well as other, new schemes that can be constructed using this approach.
 Title
 On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption
 Journal

Designs, Codes and Cryptography
Volume 12, Issue 3 , pp 215243
 Cover Date
 199711
 DOI
 10.1023/A:1008268610932
 Print ISSN
 09251022
 Online ISSN
 15737586
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 key distribution
 broadcast encryption
 resilient functions
 secret sharing schemes
 combinatorial designs
 Industry Sectors
 Authors

 Doug R. Stinson ^{(1)}
 Author Affiliations

 1. Department of Computer Science and Engineering, University of NebraskaLincoln, Lincoln, NE, 68588, USA