Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2008

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

Résumé

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.
Fichier principal
Vignette du fichier
dmAI0111.pdf (200.38 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01194683 , version 1 (07-09-2015)

Identifiants

Citer

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, ⟨10.46298/dmtcs.3564⟩. ⟨hal-01194683⟩

Collections

TDS-MACS
110 Consultations
525 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More