1255 search results - page 68 / 251 » On Simple and Secure Key Distribution |
132
Voted
CCS
2010
ACM
15 years 4 months ago
2010
ACM
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
135
click to vote
ICDCSW
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
138
Voted
ECOOPW
1999
Springer
15 years 7 months ago
1999
Springer
Existing authorization mechanisms fail to provide powerful and robust tools for handling security at the scale necessary for today's Internet. These mechanisms are coming unde...
159
click to vote
DC
1999
15 years 3 months ago
1999
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
141
Voted
IJRR
2008
15 years 3 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...