Sciweavers

1028 search results - page 73 / 206
» Using Attack Graphs to Design Systems
Sort
View
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 10 months ago
Security of public key cryptosystems based on Chebyshev Polynomials
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptogra...
Pina Bergamo, Paolo D'Arco, Alfredo De Santis, Lju...
CIKM
2009
Springer
14 years 5 months ago
SPIDER: a system for scalable, parallel / distributed evaluation of large-scale RDF data
RDF is a data model for representing labeled directed graphs, and it is used as an important building block of semantic web. Due to its flexibility and applicability, RDF has bee...
Hyunsik Choi, Jihoon Son, YongHyun Cho, Min Kyoung...
CCS
2009
ACM
14 years 5 months ago
XCS: cross channel scripting and its impact on web applications
We study the security of embedded web servers used in consumer electronic devices, such as security cameras and photo frames, and for IT infrastructure, such as wireless access po...
Hristo Bojinov, Elie Bursztein, Dan Boneh
CN
2007
106views more  CN 2007»
13 years 10 months ago
Learning DFA representations of HTTP for protecting web applications
Intrusion detection is a key technology for self-healing systems designed to prevent or manage damage caused by security threats. Protecting web server-based applications using in...
Kenneth L. Ingham, Anil Somayaji, John Burge, Step...
RANDOM
1998
Springer
14 years 2 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang