Resilient Authentication Using Path Independence
IEEE Transactions on Computers
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Certificate chain discovery in SPKI?SDSI
Journal of Computer Security
ConChord: Cooperative SDSI Certificate Storage and Name Resolution
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Distributed credential chain discovery in trust management
Journal of Computer Security
dRBAC: Distributed Role-based Access Control for Dynamic Coalition Environments
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Certificate Dispersal in Ad-Hoc Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An Optimal Certificate Dispersal Algorithm for Mobile Ad Hoc Networks
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Vulnerability analysis of certificate graphs
International Journal of Security and Networks
Stabilizing certificate dispersal
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
IEEE Network: The Magazine of Global Internetworking
Using New Tools for Certificate Repositories Generation in MANETs
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
Efficient public key certificate management for mobile ad hoc networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
| Hi-index | 0.00 |
We consider a network where users can issue certificates that identify the public keys of other users in the network. The issued certificates in a network constitute a set of certificate chains between users. A user u can obtain the public key of another user v from a certificate chain from u to v in the network. For the certificate chain from u to v, u is called the source of the chain and v is called the destination of the chain. Certificates in each chain are dispersed between the source and destination of the chain such that the following condition holds. If any user u needs to securely send messages to any other user v in the network, then u can use the certificates stored in u and v to obtain the public key of v (then u can use the public key of v to set up a shared key with v to securely send messages to v). The cost of dispersing certificates in a set of chains among the source and destination users in a network is measured by the total number of certificates that need to be stored in all users. A dispersal of a set of certificate chains in a network is optimal if no other dispersal of the same chain set has a strictly lower cost. In this paper, we show that the problem of computing optimal dispersal of a given chain set is NP-complete. Thus, minimizing the total number of certificates stored in all users is NP--complete. We identify three special classes of chain sets that are of practical interests and devise three polynomial-time algorithms that compute optimal dispersals for each class. We also present two polynomial-time extensions of these algorithms for more general classes of chain sets.