Sciweavers

3821 search results - page 279 / 765
» A Security Model for Aglets
Sort
View
CSREASAM
2003
15 years 8 months ago
Randomized Traitor Tracing Algorithms for Broadcast Security
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
Simon McNicol, Serdar Boztas
184
Voted
TIFS
2008
149views more  TIFS 2008»
15 years 6 months ago
Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach
In autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
Wei Yu, K. J. Ray Liu
CCS
2007
ACM
16 years 25 days ago
Non-volatile memory and disks: avenues for policy architectures
As computing models change, so too do the demands on storage. Distributed and virtualized systems introduce new vulnerabilities, assumptions, and performance requirements on disks...
Kevin R. B. Butler, Stephen E. McLaughlin, Patrick...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 25 days ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
ESORICS
2007
Springer
16 years 24 days ago
SilentKnock: Practical, Provably Undetectable Authentication
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
Eugene Y. Vasserman, Nicholas Hopper, John Laxson,...