Sciweavers

621 search results - page 75 / 125
» Efficient Secure Multi-party Computation
Sort
View
SAC
2008
ACM
13 years 10 months ago
Privacy-preserving link discovery
Abstract. Link discovery is a process of identifying association(s) among different entities included in a complex network structure. These association(s) may represent any interac...
Xiaoyun He, Basit Shafiq, Jaideep Vaidya, Nabil R....
INFORMATICALT
2006
134views more  INFORMATICALT 2006»
13 years 11 months ago
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Je...
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 11 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
CCS
2008
ACM
14 years 1 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...
MOBIHOC
2005
ACM
14 years 10 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