Securing Mobile Ad Hoc Networks with Certificateless Public Keys
IEEE Transactions on Dependable and Secure Computing
Optimal Dispersal of Certificate Chains
IEEE Transactions on Parallel and Distributed Systems
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
IEEE Transactions on Information Forensics and Security
Approximability and inapproximability of the minimum certificate dispersal problem
Theoretical Computer Science
Stabilizing certificate dispersal
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
Minimum certificate dispersal with tree structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
We investigate how to disperse the certificates, issued in an ad-hoc network, among the network nodes such that the following condition holds. If any node u approaches any other node v in the network, then u can use the certificates stored either in u or in v to obtain the public key of v (so that u can securely send messages to v). We define the cost of certificate dispersal as the average number of certificates stored in one node in the network. We give upper and lower bounds on the dispersability cost of certificates, and show that both bounds are tight. We also present two certificate dispersal algorithms, and show that one of those algorithms is more efficient than the other in several important cases. Finally, we identify a rich class of "certificate graphs" for which the dispersability cost is within a constant factor from the lower bound.