How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
The quest for security in mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Self-Organized Public-Key Management for Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Authentication protocols for ad hoc networks: taxonomy and research issues
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
Efficient Node Admission for Short-lived Mobile Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
IEICE - Transactions on Information and Systems
A Secure Strong-Password Authentication Protocol
Fundamenta Informaticae
A self-organized authentication architecture in mobile ad-hoc networks
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
This work proposes a new global authentication system for Mobile Ad-hoc Networks. The component algorithms are designed in a self-organizing way so that most needs of this sort of networks are covered. In particular, characteristics such as adaptation to the varying topology of the network, open availability of broadcast transmissions, and strong access control have received special attention when defining the new scheme. The described protocol is based on the cryptographic paradigm of Zero-Knowledge Proofs. In this paper the design is thought for the Hamiltonian Cycle Problem, but it might be easily adapted to other NP-complete graph problems.