In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish a common key. This scheme made use of a key predistribution scheme due to Blom. In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes. Our constructions use the key predistribution scheme of Blundo et al., which is a generalization of the Blom scheme. We obtain families of schemes in which the amount of secret information held by the network users can be traded off against the amount of information that needs to be broadcast. We also consider lower bounds for protocols of these types, using the concept of entropy as our main tool. Some of our schemes are optimal (or close to optimal) with respect to the bounds we prove. © 1998 - Elsevier Science B.V. All rights reserved.
Blundo, C., Frota Mattos, L. A., & Stinson, D. R. (1998). Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution. Theoretical Computer Science, 200(1–2), 313–334. https://doi.org/10.1016/S0304-3975(98)80007-8