Sciweavers

49 search results - page 2 / 10
» Anonymity protocols as noisy channels
Sort
View
CCS
2009
ACM
14 years 6 months ago
Quantifying maximal loss of anonymity in protocols
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
Han Chen, Pasquale Malacaria
IACR
2011
152views more  IACR 2011»
12 years 5 months ago
Rational distance-bounding protocols over noisy channels
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
Long H. Nguyen

Publication
545views
14 years 2 months ago
Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first ...
A. Mitrokotsa, C. Dimitrakakis, P. Peris-Lopez, J....
ESAS
2007
Springer
13 years 11 months ago
Distance Bounding in Noisy Environments
Location information can be used to enhance mutual entity authentication protocols in wireless ad-hoc networks. More specifically, distance bounding protocols have been introduced...
Dave Singelée, Bart Preneel
SPW
1997
Springer
13 years 9 months ago
Protocols Using Anonymous Connections: Mobile Applications
This paper describes security protocols that use anonymous channels as primitive, much in the way that key distribution protocols ryption as primitive. This abstraction allows us t...
Michael G. Reed, Paul F. Syverson, David M. Goldsc...