Sciweavers

Share
SPC
2005
Springer

Ephemeral Pairing on Anonymous Networks

10 years 12 days ago
Ephemeral Pairing on Anonymous Networks
The ephemeral pairing problem requires two or more specific physical nodes in a wireless broadcast network, that do not yet know each other, to establish a short-term relationship between them. Such shortlived pairings occur, for example, when one pays at a check-out using a wireless wallet. This problem is equivalent to the ephemeral key exchange problem, where one needs to establish a high-entropy shared session key between two nodes given only a low bandwidth authentic (or private) communication channel between the pair, and a high bandwidth shared broadcast channel. We study this problem for truly anonymous broadcast networks, discuss certain impossible scenarios and present several protocols depending on the type of communication channel between the nodes.
Jaap-Henk Hoepman
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where SPC
Authors Jaap-Henk Hoepman
Comments (0)
books