A new authentication protocol for revocable anonymity in ad-hoc networks

Simple item page
dc.creatorWierzbicki, Adam
dc.creatorZwierko, Aneta
dc.creatorKotulski, Zbigniew
dc.date2005-10-22
dc.date.accessioned2026-07-07T06:46:17Z
dc.date.available2026-07-07T06:46:17Z
dc.descriptionThis 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.
dc.description8 pages, 8 figures, this an extended version of paper accepted for IASTED conference CNIS'2005
dc.identifierhttps://arxiv.org/abs/cs/0510065
dc.identifierhttp://arxiv.org/abs/cs/0510065
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103288
dc.subjectCryptography and Security
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectNetworking and Internet Architecture
dc.subjectC.2.0; C.2.4
dc.titleA new authentication protocol for revocable anonymity in ad-hoc networks
dc.typetext

Files

Collections

arXiv