CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Equitable colorings extend Chernoff-Hoeffding bounds
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
An exclusive set system is a family of subsets of a universe with the property that every large subset may be written as the union of subsets from the family. We obtain new upper bounds on the size of such families, showing that in a universe of n elements, there is a system of 48k3 (nk)r/k In subsets with the property that every subset of the universe of size n -- r can be written as the union of k subsets in the system. Such sets systems form the combinatorial foundation of many broadcast encryption schemes.