scispace - formally typeset
Book ChapterDOI

The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks

Reads0
Chats0
TLDR
A resurrecting duckling security policy model is presented, which describes secure transient association of a device with multiple serialised owners over the air in a short range wireless channel.
Abstract
In the near future, many personal electronic devices will be able to communicate with each other over a short range wireless channel. We investigate the principal security issues for such an environment. Our discussion is based on the concrete example of a thermometer that makes its readings available to other nodes over the air. Some lessons learned from this example appear to be quite general to ad-hoc networks, and rather different from what we have come to expect in more conventional systems: denial of service, the goals of authentication, and the problems of naming all need re-examination. We present the resurrecting duckling security policy model, which describes secure transient association of a device with multiple serialised owners.

read more

Content maybe subject to copyright    Report

Citations
More filters

Key distribution mechanisms for wireless sensor networks : a survey

TL;DR: This work evaluates deterministic, probabilistic and hybrid type of key pre-distribution and dynamic key generation algorithms for distributing pair-wise, group-wise and network-wise keys in distributed and hierarchical wireless sensor networks.
Proceedings ArticleDOI

PIKE: peer intermediaries for key establishment in sensor networks

TL;DR: This work describes peer intermediaries for key establishment (PIKE), a class of key-establishment protocols that involves using one or more sensor nodes as a trusted intermediary to facilitate key establishment, and shows that both the communication and memory overheads of PIKE protocols scale sub-linearly with the number of nodes in the network yet achieving higher security against node compromise than other protocols.
Journal ArticleDOI

Key agreement in ad hoc networks

TL;DR: This paper considers a problem: a group of people in a meeting room do not have access to public key infrastructure or third party key management service, and they do not share any other prior electronic context, and how can they set up a secure session among their computers?
Book ChapterDOI

Minimalist cryptography for low-cost RFID tags (extended abstract)

Ari Juels
TL;DR: It is shown that standard cryptography is not necessary as a starting point for improving security of very weak RFID devices, and a new security model for authentication and privacy in RFID tags is proposed, which involves no computationally intensive cryptographic operations, and relatively little storage.
References
More filters
Journal ArticleDOI

New Directions in Cryptography

TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.

Integrity Considerations for Secure Computer Systems

K. J. Biba
TL;DR: The author identifies the integrity problems posed by a secure military computer utility and integrity policies addressing these problems are developed and their effectiveness evaluated.

Tamper resistance: a cautionary note

TL;DR: It is concluded that trusting tamper resistance is problematic; smartcards are broken routinely, and even a device that was described by a government signals agency as 'the most secure processor generally available' turns out to be vulnerable.
Book ChapterDOI

Low Cost Attacks on Tamper Resistant Devices

TL;DR: A number of attacks that can be mounted by opponents with much shallower pockets, such as smart-cards, are described.
Journal Article

Low cost attacks on tamper resistant devices

TL;DR: In this article, the authors describe a number of attacks that can be mounted by opponents with much shallower pockets, three of them involve special (but low cost) equipment: differential fault analysis, chip rewriting, and memory remanence.