Authenticating ad hoc networks by comparison of short digests

We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted third parties, but rather using a minimum of work by human user(s) implementing the low-band width unspoofable channels betwe...

Full description

Saved in:
Bibliographic Details
Published in:Information and computation 2008-02, Vol.206 (2), p.250-271
Main Authors: Nguyen, L.H., Roscoe, A.W.
Format: Article
Language:English
Subjects:
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Computer science
control theory
systems
Designs and configurations
Exact sciences and technology
Mathematics
Miscellaneous
Sciences and techniques of general use
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted third parties, but rather using a minimum of work by human user(s) implementing the low-band width unspoofable channels between them. We develop both pairwise and group protocols which are essentially optimal in human effort and, given that, computation. We compare our protocols with recent pairwise protocols proposed by, for example, Hoepman and Vaudenay. We introduce and analyse a new cryptographic primitive—a digest function—that is closely related to short-output universal hash functions.
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2007.07.010