Sciweavers

2714 search results - page 156 / 543
» Approximation Schemes for Scheduling
Sort
View
CSFW
2007
IEEE
15 years 7 months ago
Compositional Security for Task-PIOAs
Task-PIOA is a modeling framework for distributed systems with both probabilistic and nondeterministic behaviors. It is suitable for cryptographic applications because its task-bas...
Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Nan...
116
Voted
EUROCRYPT
2010
Springer
15 years 5 months ago
Fully Homomorphic Encryption over the Integers
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s techniques to convert it into a fully homomorph...
Marten van Dijk, Craig Gentry, Shai Halevi, Vinod ...
99
Voted
IJSNET
2008
125views more  IJSNET 2008»
15 years 24 days ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
92
Voted
ENTCS
2007
98views more  ENTCS 2007»
15 years 23 days ago
Evaluating Complex MAC Protocols for Sensor Networks with APMC
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...
Michaël Cadilhac, Thomas Hérault, Rich...
113
Voted
SECON
2008
IEEE
15 years 7 months ago
A Demonstration of Video over a User Centric Prioritization Scheme for Wireless LANs
—Due to the unreliable nature of the wireless medium, provisioning of the Quality of Service (QoS) in wireless LANs is by far more complicated than in wired networks. In this dem...
Konstantinos Choumas, Thanasis Korakis, Leandros T...