Computer Science – Cryptography and Security
Scientific paper
2005-10-22
Computer Science
Cryptography and Security
8 pages, 8 figures, this an extended version of paper accepted for IASTED conference CNIS'2005
Scientific paper
This paper describes a new protocol for authentication in ad-hoc networks. The protocol has been designed to meet specialized requirements of ad-hoc networks, such as lack of direct communication between nodes or requirements for revocable anonymity. At the same time, a ad-hoc authentication protocol must be resistant to spoofing, eavesdropping and playback, and man-in-the-middle attacks. The article analyzes existing authentication methods based on the Public Key Infrastructure, and finds that they have several drawbacks in ad-hoc networks. Therefore, a new authentication protocol, basing on established cryptographic primitives (Merkle's puzzles and zero-knowledge proofs) is proposed. The protocol is studied for a model ad-hoc chat application that provides private conversations.
Kotulski Zbigniew
Wierzbicki Adam
Zwierko Aneta
No associations
LandOfFree
A new authentication protocol for revocable anonymity in ad-hoc networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A new authentication protocol for revocable anonymity in ad-hoc networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new authentication protocol for revocable anonymity in ad-hoc networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-170635