Sciweavers

5804 search results - page 222 / 1161
» Doing more with less
Sort
View
ASIACRYPT
2009
Springer
16 years 1 months ago
Security Notions and Generic Constructions for Client Puzzles
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
Liqun Chen, Paul Morrissey, Nigel P. Smart, Bogdan...
ESOP
2005
Springer
16 years 4 days ago
Programming with Explicit Security Policies
Are computing systems trustworthy? To answer this, we need to know three things: what the systems are supposed to do, what they are not supposed to do, and what they actually do. A...
Andrew C. Myers
SIGCOMM
2003
ACM
15 years 12 months ago
A framework for classifying denial of service attacks
Launching a denial of service (DoS) attack is trivial, but detection and response is a painfully slow and often a manual process. Automatic classification of attacks as single- o...
Alefiya Hussain, John S. Heidemann, Christos Papad...
ICC
2009
IEEE
139views Communications» more  ICC 2009»
16 years 1 months ago
Ergodic Secrecy Capacity Region of the Fading Broadcast Channel
— We consider the fading broadcast channel from a secrecy point of view. In this channel, each user views the other user as an eavesdropper, and wants to keep its information as ...
Ersen Ekrem, Sennur Ulukus
ICPP
2007
IEEE
16 years 27 days ago
Improving Search Using a Fault-Tolerant Overlay in Unstructured P2P Systems
Gnutella overlays have evolved to use a two-tier topology. However, we observed that the new topology had only achieved modest improvements in search success rates. Also, the new ...
William Acosta, Surendar Chandra