Sciweavers

25 search results - page 3 / 5
» Towards identity anonymization on graphs
Sort
View
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Distributed anonymous discrete function computation
We propose a model for deterministic distributed function computation by a network of identical and anonymous nodes. In this model, each node has bounded computation and storage c...
Julien M. Hendrickx, Alexander Olshevsky, John N. ...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 1 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
14 years 2 months 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
PERCOM
2010
ACM
13 years 5 months ago
Privacy-preserving admission to mobile peer-to-peer groups
Mobile peer-to-peer groups, which do not require any pre-deployed infrastructure or trusted centralized authority are valuable for a variety of collaborative applications. This wor...
Mark Manulis
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
14 years 9 months ago
Preserving Privacy in Social Networks Against Neighborhood Attacks
Recently, as more and more social network data has been published in one way or another, preserving privacy in publishing social network data becomes an important concern. With som...
Bin Zhou 0002, Jian Pei