Natural Sciences and Engineering Research Council of Canada
Indicators
641
Views
485
Downloads
Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers
Christopher Eagle (1), Zhicheng Gao (2), Mohamed Omar (3), Daniel Panario (2), Bruce Richmond (4)
(1) Combinatorics and Optimization [Waterloo]
(2) School of Mathematics and Statistics [Ottawa]
(3) Department of Mathematics [Univ California Davis]
(4) Department of Combinatorics and Optimization
Abstract
We study the number of encryptions necessary to revoke a set of users in the complete subtree scheme (CST) and the subset-difference scheme (SD). These are well-known tree based broadcast encryption schemes. Park and Blake in: Journal of Discrete Algorithms, vol. 4, 2006, pp. 215―238, give the mean number of encryptions for these schemes. We continue their analysis and show that the limiting distribution of the number of encryptions for these schemes is normal. This implies that the mean numbers of Park and Blake are good estimates for the number of necessary encryptions used by these schemes.
