2005/10/22 by Adam Wierzbicki, Wierzbicki, Adam, Aneta Zwierko +3
Computer Science · #Advanced Authentication Protocols Security #C.2.0 #C.2.4 #Cryptography and Security (cs.CR) #Distributed #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Parallel #Security in Wireless Sensor Networks #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.cs/0510065
openalex publication_date 2005/10/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.