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

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

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...

Full description

Bibliographic Details
Main Authors: Christopher Eagle, Zhicheng Gao, Mohamed Omar, Daniel Panario, Bruce Richmond
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2008-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
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]
Online Access:https://dmtcs.episciences.org/3564/pdf

Internet

https://dmtcs.episciences.org/3564/pdf

Similar Items