Sciweavers

577 search results - page 51 / 116
» Engineering Sufficiently Secure Computing
Sort
View
143
Voted
HYBRID
2010
Springer
15 years 4 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...
126
Voted
AUSFORENSICS
2004
15 years 4 months ago
Generalising Event Forensics Across Multiple Domains
In cases involving computer related crime, event oriented evidence such as computer event logs, and telephone call records are coming under increased scrutiny. The amount of techn...
Bradley Schatz, George M. Mohay, Andrew Clark
117
Voted
CCS
2009
ACM
15 years 9 months ago
A security-preserving compiler for distributed programs: from information-flow policies to cryptographic mechanisms
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
Cédric Fournet, Gurvan Le Guernic, Tamara R...
106
Voted
TRUST
2010
Springer
15 years 7 months ago
Robust Combiners for Software Hardening
All practical software hardening schemes, as well as practical encryption schemes, e.g., AES, were not proven to be secure. One technique to enhance security is robust combiners. A...
Amir Herzberg, Haya Shulman
125
Voted
SP
2010
IEEE
217views Security Privacy» more  SP 2010»
15 years 6 months ago
Experimental Security Analysis of a Modern Automobile
Abstract—Modern automobiles are no longer mere mechanical devices; they are pervasively monitored and controlled by dozens of digital computers coordinated via internal vehicular...
Karl Koscher, Alexei Czeskis, Franziska Roesner, S...