Sciweavers

5484 search results - page 57 / 1097
» Almost-Everywhere Secure Computation
Sort
View
KDD
1998
ACM
181views Data Mining» more  KDD 1998»
15 years 4 months ago
Approaches to Online Learning and Concept Drift for User Identification in Computer Security
The task in the computer security domain of anomaly detection is to characterize the behaviors of a computer user (the `valid', or `normal' user) so that unusual occurre...
Terran Lane, Carla E. Brodley
ICMLA
2003
15 years 1 months ago
Robust Support Vector Machines for Anomaly Detection in Computer Security
— Using the 1998 DARPA BSM data set collected at MIT’s Lincoln Labs to study intrusion detection systems, the performance of robust support vector machines (RVSMs) was compared...
Wenjie Hu, Yihua Liao, V. Rao Vemuri
EUROCRYPT
2000
Springer
15 years 3 months ago
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
Ronald Cramer, Ivan Damgård, Ueli M. Maurer
CCGRID
2005
IEEE
15 years 5 months ago
Implementing a secure, service oriented accounting system for computational economies
The ability to record and account for the usage of computational resources in a standardised way across different systems from multiple administrative domains is a precursor to wi...
John D. Ainsworth, Jon MacLaren, John M. Brooke
OSDI
2004
ACM
16 years 5 days ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...