Sciweavers

577 search results - page 94 / 116
» Engineering Sufficiently Secure Computing
Sort
View
ANCS
2009
ACM
14 years 7 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
DAC
2007
ACM
15 years 10 months ago
Trusted Hardware: Can It Be Trustworthy?
Processing and storage of confidential or critical information is an every day occurrence in computing systems. The trustworthiness of computing devices has become an important co...
Cynthia E. Irvine, Karl N. Levitt
EUROSYS
2009
ACM
15 years 6 months ago
Privacy-preserving browser-side scripting with BFlow
Some web sites provide interactive extensions using browser scripts, often without inspecting the scripts to verify that they are benign and bug-free. Others handle users’ conď¬...
Alexander Yip, Neha Narula, Maxwell N. Krohn, Robe...
EUROSYS
2008
ACM
15 years 6 months ago
Flicker: an execution infrastructure for tcb minimization
We present Flicker, an infrastructure for executing securitysensitive code in complete isolation while trusting as few as 250 lines of additional code. Flicker can also provide me...
Jonathan M. McCune, Bryan Parno, Adrian Perrig, Mi...
EUROSYS
2008
ACM
15 years 6 months ago
Eudaemon: involuntary and on-demand emulation against zero-day exploits
Eudaemon is a technique that aims to blur the borders between protected and unprotected applications, and brings together honeypot technology and end-user intrusion detection and ...
Georgios Portokalidis, Herbert Bos