Sciweavers

101 search results - page 4 / 21
» A Classification of Time and or Probability Dependent Securi...
Sort
View
MFCS
2007
Springer
14 years 1 months ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
ICISC
2008
103views Cryptology» more  ICISC 2008»
13 years 9 months ago
Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification
Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE c...
Ahmad-Reza Sadeghi, Thomas Schneider 0003
SUTC
2006
IEEE
14 years 1 months ago
Schedules with Minimized Access Latency for Disseminating Dependent Information on Multiple Channels
In wireless mobile environments, data broadcasting is an effective approach to disseminate information to mobile clients. In some applications, the access pattern of all the data...
Kun-Feng Lin, Chuan-Ming Liu
IMC
2010
ACM
13 years 5 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
ICMCS
2005
IEEE
123views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Nearly Lossless Content-Dependent Low-Power DCT Design for Mobile Video Applications
This paper proposes a practical content-dependent lowpower DCT design with tolerable quality drop. Lowpower issue has become more and more important, especially for portable devic...
Chia-Ping Lin, Po-Chih Tseng, Liang-Gee Chen