Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

PST
2008

favoriteEmaildiscussreport

114views Security Privacy» more PST 2008»

Unlinkable Communication

13 years 6 months ago

Unlinkable Communication

Download wiki.uni.lu

In this paper we present a protocol for unlinkable communication, i.e. where an attacker cannot map the sender and receiver node of a communication. Existing anonymity protocols either do not guarantee unlinkability (e.g. Tor and Mix networks), or produce huge overhead

Volker Fusenig, Eugen Staab, Uli Sorger, Thomas En

Real-time Traffic

Ad Hoc Communication | Dining Cryptographers Network | PST 2008 | Security Privacy | Unlinkable Communication |

claim paper

Related Content

» Attacking Unlinkability The Importance of Context

» Physical Layer Attacks on Unlinkability in Wireless LANs

» Maintaining Unlinkability in Group Based P2P Environments

» A Model of Onion Routing with Provable Anonymity

» Modelling of Pseudonymity under Probabilistic Linkability Attacks

» Relations Among Privacy Notions

» Fragile mixing

» PseudoVoter Identity PVID Scheme for eVoting Protocols

» Provable anonymity

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	PST
Authors	Volker Fusenig, Eugen Staab, Uli Sorger, Thomas Engel

Comments (0)