49 search results - page 4 / 10 » Anonymity protocols as noisy channels |
STOC
1994
ACM
15 years 1 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
JSAC
2011
14 years 4 months ago
2011
— The growing interest in vehicular ad hoc networks (VANETs) enables decentralized traveler information systems to become more feasible and effective in Intelligent Transportatio...
CARDIS
2006
Springer
15 years 1 months ago
2006
Springer
We propose a protocol that can be used between an RFID tag and a reader to exchange a secret without performing any expensive computation. Similarly to the famous blocker tag sugge...
COMBINATORICA
2007
14 years 9 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
128
click to vote
SPC
2005
Springer
15 years 3 months ago
2005
Springer
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...