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.
Type de document :
Communication dans un congrès
Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.195-206, 2008, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01194683
Contributeur : Coordination Episciences Iam <>
Soumis le : lundi 7 septembre 2015 - 12:51:06
Dernière modification le : mercredi 10 mai 2017 - 17:41:08
Document(s) archivé(s) le : mardi 8 décembre 2015 - 13:01:12

Fichier

dmAI0111.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • 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. Roesler, Uwe. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science, pp.195-206, 2008, DMTCS Proceedings. 〈hal-01194683〉

Partager

Métriques

Consultations de la notice

183

Téléchargements de fichiers

91