Sciweavers

21 search results - page 1 / 5
» Modelling of Pseudonymity under Probabilistic Linkability At...
Sort
View
CSE
2009
IEEE
14 years 2 months ago
Modelling of Pseudonymity under Probabilistic Linkability Attacks
—This paper contributes to the field of measuring (un)linkability in communication systems; a subproblem of privacy protection. We propose an attacker state model for attacks on...
Martin Neubauer
WECWIS
2005
IEEE
86views ECommerce» more  WECWIS 2005»
14 years 1 months ago
The Evolution of Cooperation under Cheap Pseudonyms
A wide variety of interactions on the Internet are characterized by the availability of cheap pseudonyms, where users can obtain new identities freely or at a low cost. Due to the...
Michal Feldman, John Chuang
CCS
2004
ACM
14 years 1 months ago
Direct anonymous attestation
This paper describes the direct anonymous attestation scheme (DAA). This scheme was adopted by the Trusted Computing Group as the method for remote authentication of a hardware mo...
Ernest F. Brickell, Jan Camenisch, Liqun Chen
DSN
2007
IEEE
14 years 2 months ago
Multiprocessors May Reduce System Dependability under File-Based Race Condition Attacks
Attacks exploiting race conditions have been considered rare and “low risk”. However, the increasing popularity of multiprocessors has changed this situation: instead of waiti...
Jinpeng Wei, Calton Pu
CCS
2006
ACM
13 years 11 months ago
Hot or not: revealing hidden services by their clock skew
Location-hidden services, as offered by anonymity systems such as Tor, allow servers to be operated under a pseudonym. As Tor is an overlay network, servers hosting hidden service...
Steven J. Murdoch