Sciweavers

2139 search results - page 327 / 428
» Distributed computing and computer security education
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 9 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
ICCS
2004
Springer
14 years 2 months ago
Demonstrating Wireless IPv6 Access to a Federated Health Record Server
: This paper describes the practical implementation of a federated health record server based on a generic and comprehensive architecture, deployed in a live clinical setting and a...
Dipak Kalra, David Ingram, A. Austin, V. Griffith,...
SACMAT
2009
ACM
14 years 3 months ago
Working set-based access control for network file systems
Securing access to files is an important and growing concern in corporate environments. Employees are increasingly accessing files from untrusted devices, including personal hom...
Stephen Smaldone, Vinod Ganapathy, Liviu Iftode
CCS
2006
ACM
14 years 25 days ago
Design space and analysis of worm defense strategies
We give the first systematic investigation of the design space of worm defense system strategies. We accomplish this by g a taxonomy of defense strategies by abstracting away impl...
David Brumley, Li-Hao Liu, Pongsin Poosankam, Dawn...
ASIACRYPT
2011
Springer
12 years 9 months ago
Leakage-Resilient Cryptography from the Inner-Product Extractor
We present a generic method to secure various widely-used cryptosystems against arbitrary side-channel leakage, as long as the leakage adheres three restrictions: first, it is bou...
Stefan Dziembowski, Sebastian Faust