Sciweavers

346 search results - page 57 / 70
» Can we trust docking results
Sort
View
TON
2008
103views more  TON 2008»
13 years 7 months ago
On the race of worms, alerts, and patches
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
Milan Vojnovic, Ayalvadi J. Ganesh
IEEEARES
2010
IEEE
14 years 27 days ago
LSM-Based Secure System Monitoring Using Kernel Protection Schemes
—Monitoring a process and its file I/O behaviors is important for security inspection for a data center server against intrusions, malware infection and information leakage. In ...
Takamasa Isohara, Keisuke Takemori, Yutaka Miyake,...
EUROCRYPT
2001
Springer
14 years 2 days ago
Cryptographic Counters and Applications to Electronic Voting
We formalize the notion of a cryptographic counter, which allows a group of participants to increment and decrement a cryptographic representation of a (hidden) numerical value pri...
Jonathan Katz, Steven Myers, Rafail Ostrovsky
ASIACRYPT
2001
Springer
14 years 2 days ago
Fully Distributed Threshold RSA under Standard Assumptions
The aim of this article is to propose a fully distributed environment for the RSA scheme. What we have in mind is highly sensitive applications and even if we are ready to pay a pr...
Pierre-Alain Fouque, Jacques Stern
TIFS
2011
252views Education» more  TIFS 2011»
13 years 2 months ago
Secure Device Pairing Based on a Visual Channel: Design and Usability Study
— “Pairing” is the establishment of authenticated key agreement between two devices over a wireless channel. Such devices are ad hoc in nature as they lack any common preshar...
Nitesh Saxena, Jan-Erik Ekberg, Kari Kostiainen, N...