Sciweavers

212 search results - page 18 / 43
» Anonymity and k-Choice Identities
Sort
View
SIROCCO
2010
14 years 8 months ago
Optimal Deterministic Ring Exploration with Oblivious Asynchronous Robots
We consider the problem of exploring an anonymous unoriented ring of size n by k identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the abil...
Anissa Lamani, Maria Gradinariu Potop-Butucaru, S&...
PODC
2011
ACM
14 years 15 days ago
Securing social networks
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
Michael Backes, Matteo Maffei, Kim Pecina
ESORICS
2012
Springer
13 years 1 days ago
Exploring Linkability of User Reviews
Large numbers of people all over the world read and contribute to various review sites. Many contributors are understandably concerned about privacy in general and, specifically,...
Mishari Al Mishari, Gene Tsudik
CCS
2006
ACM
15 years 1 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
ICDCS
2002
IEEE
15 years 2 months ago
An Optimal Strategy for Anonymous Communication Protocols
For many Internet applications, the ability to protect the identity of participants in a distributed applications is critical. For such applications, a number of anonymous communi...
Yong Guan, Xinwen Fu, Riccardo Bettati, Wei Zhao