Journal article
Authenticating ad hoc networks by comparison of short digests
- Abstract:
- 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. © 2007 Elsevier Inc. All rights reserved.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 242.4KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.ic.2007.07.010
Authors
- Publisher:
- Elsevier
- Journal:
- INFORMATION AND COMPUTATION More from this journal
- Volume:
- 206
- Issue:
- 2-4
- Pages:
- 250-271
- Publication date:
- 2008-01-01
- DOI:
- EISSN:
-
1090-2651
- ISSN:
-
0890-5401
- Language:
-
English
- Pubs id:
-
290017
- UUID:
-
uuid:3e19d041-77a8-42de-a2d0-f464a6166b75
- Local pid:
-
pubs:290017
- Source identifiers:
-
290017
- Deposit date:
-
2012-12-19
- ARK identifier:
Terms of use
- Copyright holder:
- Elsevier BV
- Copyright date:
- 2008
- Notes:
- Copyright 2007 Elsevier Inc. All rights reserved. Re-use of this article is permitted in accordance with the Terms and Conditions set out at http://www.elsevier.com/open-access/userlicense/1.0/
- Licence:
- Other
If you are the owner of this record, you can report an update to it here: Report update to this record