Sciweavers

1351 search results - page 270 / 271
» Trust in Anonymity Networks
Sort
View
OSDI
1996
ACM
14 years 6 days ago
Safe Kernel Extensions Without Run-Time Checking
This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel r...
George C. Necula, Peter Lee
TON
2008
103views more  TON 2008»
13 years 10 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
JOC
2007
84views more  JOC 2007»
13 years 10 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
12 years 1 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
AAAI
2008
14 years 1 months ago
RADAR: A Personal Assistant that Learns to Reduce Email Overload
Email client software is widely used for personal task management, a purpose for which it was not designed and is poorly suited. Past attempts to remedy the problem have focused o...
Michael Freed, Jaime G. Carbonell, Geoffrey J. Gor...