On the mean number of encryptions for tree-based broadcast encryption schemes (Q2458926)

Stateless-receiver broadcast encryption schemes require minimum number of keys as well as encryptions. Tree-based key distribution schemes attain best known trade-off between the two parameters. The authors study three schemes -- the complete subtree (CST), the subset difference (SD) and the layered subset difference (LSD) [see references in the original article] and introduce their generating functions. The mean number of encryptions over all privileged sets of users as well as the mean number of encryptions when the number of privileged users is fixed is derived for all three studied schemes.