Sciweavers

70 search results - page 3 / 14
» Algebraic Intruder Deductions
Sort
View
ICALP
2005
Springer
13 years 10 months ago
Combining Intruder Theories
Abstract. Most of the decision procedures for symbolic analysis of protocols are limited to a fixed set of algebraic operators associated with a fixed intruder theory. Examples o...
Yannick Chevalier, Michaël Rusinowitch
LICS
2003
IEEE
13 years 9 months ago
An NP Decision Procedure for Protocol Insecurity with XOR
We provide a method for deciding the insecurity of cryptographic protocols in presence of the standard Dolev-Yao intruder (with a finite number of sessions) extended with so-call...
Yannick Chevalier, Ralf Küsters, Michaël...
IWIA
2005
IEEE
13 years 10 months ago
Attack-Potential-Based Survivability Modeling for High-Consequence Systems
Previous quantitative models of security or survivability have been defined on a range of probable intruder behavior. This measures survivability as a statistic such as mean time...
John McDermott
APAL
2010
90views more  APAL 2010»
13 years 4 months ago
Canonical extensions for congruential logics with the deduction theorem
We introduce a new and general notion of canonical extension for algebras in the algebraic counterpart AlgS of any finitary and congruential logic S. This definition is logic-base...
Mai Gehrke, Ramon Jansana, Alessandra Palmigiano
CADE
2007
Springer
14 years 4 months ago
Combining Deduction and Algebraic Constraints for Hybrid System Analysis
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
André Platzer