Sciweavers

45 search results - page 7 / 9
» Efficient Handling of Adversary Attacks in Aggregation Appli...
Sort
View
CCS
2009
ACM
14 years 8 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
ICDE
2009
IEEE
214views Database» more  ICDE 2009»
14 years 9 months ago
Ranking with Uncertain Scores
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
Mohamed A. Soliman, Ihab F. Ilyas
ICC
2007
IEEE
180views Communications» more  ICC 2007»
14 years 1 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
CRYPTO
2010
Springer
162views Cryptology» more  CRYPTO 2010»
13 years 7 months ago
On Strong Simulation and Composable Point Obfuscation
The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: Anything computable by an efficient adversary given the obfuscated program can also be co...
Nir Bitansky, Ran Canetti
MOBIHOC
2005
ACM
14 years 7 months ago
Least privilege and privilege deprivation: towards tolerating mobile sink compromises in wireless sensor networks
Mobile sinks are needed in many sensor network applications for efficient data collection, data querying, localized sensor reprogramming, identifying and revoking compromised sens...
Wensheng Zhang, Hui Song, Sencun Zhu, Guohong Cao