Sciweavers

1414 search results - page 4 / 283
» Combining Intruder Theories
Sort
View
CCS
2010
ACM
13 years 3 months ago
Cap unification: application to protocol security modulo homomorphic encryption
We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
Siva Anantharaman, Hai Lin, Christopher Lynch, Pal...
LPAR
2005
Springer
13 years 11 months ago
Algebraic Intruder Deductions
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
David A. Basin, Sebastian Mödersheim, Luca Vi...
AINA
2008
IEEE
13 years 7 months ago
Monitoring Network Traffic to Detect Stepping-Stone Intrusion
Most network intruders tend to use stepping-stones to attack or to invade other hosts to reduce the risks of being discovered. There have been many approaches that were proposed t...
Jianhua Yang, Byong Lee, Stephen S. H. Huang
IACR
2011
152views more  IACR 2011»
12 years 5 months ago
Rational distance-bounding protocols over noisy channels
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
Long H. Nguyen
COMCOM
2008
120views more  COMCOM 2008»
13 years 5 months ago
Game theoretic models for detecting network intrusions
In this paper, we study using game theory the problem of detecting intrusions in wired infrastructure networks. Detection is accomplished by sampling a subset of the transmitted p...
Hadi Otrok, Mona Mehrandish, Chadi Assi, Mourad De...