DolevYao model

Results: 7



#Item
1On Well-founded Security Protocols (Extended Abstract) Sibylle Fr¨oschle OFFIS & University of Oldenburg, Germany Email:   Consider the decidability problem that stands behind

On Well-founded Security Protocols (Extended Abstract) Sibylle Fr¨oschle OFFIS & University of Oldenburg, Germany Email: Consider the decidability problem that stands behind

Add to Reading List

Source URL: software.imdea.org

Language: English - Date: 2014-07-17 09:25:52
2A tool for automating the computationally complete symbolic attacker (Extended Abstract) Hubert Comon-Lundh V´eronique Cortier

A tool for automating the computationally complete symbolic attacker (Extended Abstract) Hubert Comon-Lundh V´eronique Cortier

Add to Reading List

Source URL: software.imdea.org

Language: English - Date: 2014-07-17 09:25:52
3Protocol Indistinguishability and the Computationally Complete Symbolic Attacker (Extended Abstract) Gergei Bana INRIA Paris, France

Protocol Indistinguishability and the Computationally Complete Symbolic Attacker (Extended Abstract) Gergei Bana INRIA Paris, France

Add to Reading List

Source URL: software.imdea.org

Language: English - Date: 2014-07-17 09:25:52
4Abstracting Cryptographic Protocols with Tree Automata ? David Monniaux http://www.di.ens.fr/%7Fmonniaux, ´ Laboratoire d’Informatique, Ecole

Abstracting Cryptographic Protocols with Tree Automata ? David Monniaux http://www.di.ens.fr/%7Fmonniaux, ´ Laboratoire d’Informatique, Ecole

Add to Reading List

Source URL: www-verimag.imag.fr

Language: English - Date: 2007-10-18 09:44:59
51  On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol M ARZIA B USCEMI, University of Pisa

1 On the Symbolic Analysis of Low-Level Cryptographic Primitives: Modular Exponentiation and the Diffie-Hellman Protocol M ARZIA B USCEMI, University of Pisa

Add to Reading List

Source URL: www.qatar.cmu.edu

Language: English - Date: 2004-12-05 23:21:27
6Inductive Proof Method for Computational Secrecy Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell Department of Computer Science, Stanford University  Abstract. We investigate inductive methods for proving secrecy p

Inductive Proof Method for Computational Secrecy Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell Department of Computer Science, Stanford University Abstract. We investigate inductive methods for proving secrecy p

Add to Reading List

Source URL: seclab.stanford.edu

Language: English - Date: 2010-07-17 01:14:15
7

PDF Document

Add to Reading List

Source URL: seclab.stanford.edu

Language: English - Date: 2010-07-17 01:14:13