Sciweavers

41 search results - page 1 / 9
» Hierarchical combination of intruder theories
Sort
View
IANDC
2008
150views more  IANDC 2008»
13 years 4 months ago
Hierarchical combination of intruder theories
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
Yannick Chevalier, Michaël Rusinowitch
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
CORR
2010
Springer
155views Education» more  CORR 2010»
13 years 1 months ago
A Proof Theoretic Analysis of Intruder Theories
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...
Alwen Tiu, Rajeev Goré, Jeremy E. Dawson
RTA
2005
Springer
13 years 9 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
IPL
2006
118views more  IPL 2006»
13 years 4 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune