Skip to Main content Skip to Navigation
Conference papers

Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers

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.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01194683
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, September 7, 2015 - 12:51:06 PM
Last modification on : Wednesday, August 7, 2019 - 12:19:20 PM
Long-term archiving on: : Tuesday, December 8, 2015 - 1:01:12 PM

File

dmAI0111.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01194683, version 1

Collections

Citation

Christopher Eagle, Zhicheng Gao, Mohamed Omar, Daniel Panario, Bruce Richmond. Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.195-206. ⟨hal-01194683⟩

Share

Metrics

Record views

239

Files downloads

786