Discrete Mathematics & Theoretical Computer Science |

- 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

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.

Source: HAL:hal-01194683v1

Volume: DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science

Section: Proceedings

Published on: January 1, 2008

Imported on: May 10, 2017

Keywords: Heuberger's two dimensions quasi-power theorem,Hwang's quasi-power theorem,broadcast encryption,Key distribution schemes,subset-difference scheme (SD),complete subtree scheme (CST),[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Funding:

- Source : OpenAIRE Graph
- Funder: Natural Sciences and Engineering Research Council of Canada

This page has been seen 240 times.

This article's PDF has been downloaded 202 times.