Epidemic profiles and defense of scale-free networks
Proceedings of the 2003 ACM workshop on Rapid malcode
Private yet abuse resistant open publishing
Proceedings of the 15th international conference on Security protocols
| Hi-index | 0.00 |
We consider scalable certificate revocation in a public-keyinfrastructure (PKI). We introduce depender graphs, a new class ofgraphs that support efficient and fault-tolerant revocation. Nodesof a depender graph are participants that agree to forwardrevocation information to other participants. Our depender graphsare k-redundant, so that revocations are provably guaranteed to bereceived by all non-failed participants even if up to k1participants have failed. We present a protocol for constructingk-redundant depender graphs that has two desirable properties.First, it is load-balanced, in that no participant need have toomany dependers. Second, it is localized, in that it avoids the needfor any participant to maintain the global state of the dependergraph. We also give a localized protocol for restructuring thegraph in the event of permanent failures.