6164 search results - page 607 / 1233 » Teaching Computer Security |
197
click to vote
AINA
2007
IEEE
16 years 1 months ago
2007
IEEE
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic algorithms and protocols. Unfortunately, a series of res...
190
click to vote
DSOM
2007
Springer
16 years 1 months ago
2007
Springer
With an increasing number of devices that must be managed, the scalability of network and service management is a real challenge. A similar challenge seems to be solved by botnets ...
160
click to vote
WS
2006
ACM
16 years 1 months ago
2006
ACM
We introduce Integrity (I) regions, a novel security primitive that enables message authentication in wireless networks without the use of pre-established or pre-certified keys. ...
180
click to vote
NCA
2005
IEEE
16 years 25 days ago
2005
IEEE
The same network infrastructure that is essential for the operation of today’s high valued distributed systems can also be misused by malicious attackers. Experience shows that ...
183
click to vote
NDSS
2005
IEEE
16 years 25 days ago
2005
IEEE
In this paper, we focus on tradeoffs between storage cost and rekeying cost for secure multicast. Specifically, we present a family of algorithms that provide a tradeoff betwee...