Sciweavers

20 search results - page 3 / 4
» Measuring relationship anonymity in mix networks
Sort
View
CSE
2009
IEEE
13 years 3 months ago
Edge Anonymity in Social Network Graphs
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...
Lijie Zhang, Weining Zhang
WPES
2003
ACM
13 years 10 months ago
Covert channels and anonymizing networks
There have long been threads of investigation into covert channels, and threads of investigation into anonymity, but these two closely related areas of information hiding have not...
Ira S. Moskowitz, Richard E. Newman, Daniel P. Cre...
CCS
2007
ACM
13 years 11 months ago
A k-anonymous communication protocol for overlay networks
Anonymity is increasingly important for network applications concerning about censorship and privacy. The existing anonymous communication protocols generally stem from mixnet and...
Pan Wang, Peng Ning, Douglas S. Reeves
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
14 years 3 days ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
CCS
2004
ACM
13 years 10 months ago
Parallel mixing
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
Philippe Golle, Ari Juels