25 search results - page 5 / 5 » Automated Proofs for Asymmetric Encryption |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
TARK
2007
Springer
14 years 1 months ago
2007
Springer
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
LICS
2003
IEEE
14 years 21 days ago
2003
IEEE
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...
ISW
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...