Sciweavers

6164 search results - page 865 / 1233
» Teaching Computer Security
Sort
View
144
Voted
DCOSS
2006
Springer
15 years 8 months ago
Locating Compromised Sensor Nodes Through Incremental Hashing Authentication
Abstract. While sensor networks have recently emerged as a promising computing model, they are vulnerable to various node compromising attacks. In this paper, we propose COOL, a CO...
Youtao Zhang, Jun Yang 0002, Lingling Jin, Weijia ...
136
Voted
CRYPTO
1995
Springer
111views Cryptology» more  CRYPTO 1995»
15 years 8 months ago
Fast Key Exchange with Elliptic Curve Systems
The Diffie-Hellman key exchange algorithm can be implemented using the group of points on an elliptic curve over the field F2n. A software version of this using n = 155 can be o...
Richard Schroeppel, Hilarie K. Orman, Sean W. O'Ma...
135
Voted
NSDI
2008
15 years 7 months ago
Using Salience Differentials to Making Visual Cues Noticeable
There is a large body of research on how to design user interfaces for systems so as to ensure that important messages from the systems are presented to the user to maximize the p...
Andreas P. Heiner, N. Asokan
146
Voted
ANCS
2008
ACM
15 years 7 months ago
Towards effective network algorithms on multi-core network processors
To build high-performance network devices with holistic security protection, a large number of algorithms have been proposed. However, multi-core implementation of the existing al...
Yaxuan Qi, Zongwei Zhou, Baohua Yang, Fei He, Yibo...
140
Voted
PODC
2010
ACM
15 years 7 months ago
Brief announcement: capacity of byzantine agreement with finite link capacity - complete characterization of four-node networks
In this paper, we consider the problem of maximizing the throughput of Byzantine agreement, when communication links have finite capacity. Byzantine agreement is a classical probl...
Guanfeng Liang, Nitin Vaidya