Sciweavers

251 search results - page 43 / 51
» On privacy preservation against adversarial data mining
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Secure Aggregation in Large Scale Overlay Networks
Overlay networks have been very useful in solving large scale data dissemination problems. In this paper, we consider the case of data gathering which is the inverse of disseminat...
Waseem Ahmad, Ashfaq A. Khokhar
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 9 months ago
k-Anonymization Revisited
In this paper we introduce new notions of k-type anonymizations. Those notions achieve similar privacy goals as those aimed by Sweenie and Samarati when proposing the concept of k-...
Aristides Gionis, Arnon Mazza, Tamir Tassa
ICDM
2006
IEEE
93views Data Mining» more  ICDM 2006»
14 years 1 months ago
Comparisons of K-Anonymization and Randomization Schemes under Linking Attacks
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attrib...
Zhouxuan Teng, Wenliang Du
IEEEARES
2007
IEEE
14 years 2 months ago
STEF: A Secure Ticket-Based En-route Filtering Scheme for Wireless Sensor Networks
— Node compromise is a serious threat in wireless sensor networks. An adversary can use compromised nodes to inject false data into the network forging events to deceive the base...
Christoph Krauß, Markus Schneider, Kpatcha M...
ESORICS
2012
Springer
11 years 10 months ago
Secure Proximity Detection for NFC Devices Based on Ambient Sensor Data
In certain applications, it is important for a remote server to securely determine whether or not two mobile devices are in close physical proximity. In particular, in the context ...
Tzipora Halevi, Di Ma, Nitesh Saxena, Tuo Xiang