| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429139 | Information Processing Letters | 2009 | 4 Pages |
Abstract
Dutta and Mukhopadhyay have recently proposed some very efficient self-healing key distribution schemes with revocation. The parameters of these schemes contradict some results (lower bounds) presented by Blundo et al. In this paper different attacks against the schemes of Dutta and Mukhopadhyay are explained: one of them can be easily avoided with a slight modification in the schemes, but the other one is really serious.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
