Sciweavers

98 search results - page 3 / 20
» Achieving anonymity via clustering
Sort
View
CN
2010
164views more  CN 2010»
13 years 5 months ago
Attribute-based on-demand multicast group setup with membership anonymity
In many applications, it is desired to dynamically establish temporary multicast groups for secure message delivery. It is also often the case that the group membership informatio...
Shucheng Yu, Kui Ren, Wenjing Lou
ICDM
2009
IEEE
130views Data Mining» more  ICDM 2009»
13 years 3 months ago
Efficient Anonymizations with Enhanced Utility
The k-anonymization method is a commonly used privacy-preserving technique. Previous studies used various measures of utility that aim at enhancing the correlation between the orig...
Jacob Goldberger, Tamir Tassa
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 2 days ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy
NSDI
2007
13 years 8 months ago
Information Slicing: Anonymity Using Unreliable Overlays
This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the...
Sachin Katti, Jeff Cohen, Dina Katabi
GLOBECOM
2009
IEEE
14 years 15 days ago
Anonymous Cardinality Estimation in RFID Systems with Multiple Readers
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
Vahid Shah-Mansouri, Vincent W. S. Wong