Mathieu Baudet  Home/Search
Context
Related
| lsv.enscachan.fr/Publis...B04sasyft.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsv.enscachan....blisy3all.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For several decades two di#erent communities have been working on the formal security of cryptographic protocols. Many e#orts have been made recently to take benefit of both approaches, in brief: the comprehensiveness of computational models and the automatizability of formal methods. The purpose of this paper is to investigate an original approach to relate the two views, that is: to extend existing Dolev-Yao models to account for random polynomial-time (Las Vegas) computability. This is... (Update)
Active bibliography (related documents): More All
2.0: Random polynomial-time attacks and Dolev-Yao models - Baudet (2003) (Correct)
0.9: Computationally Sound Verification of Security Protocols.. - Lakhnech, Mazare (2005) (Correct)
0.5: Modelling and Security Analysis of Authenticated Group Key.. - Pereira (2003) (Correct)
Similar documents based on text: More All
0.4: Computationally Sound Implementations of Equational.. - Baudet, Cortier, Kremer (2005) (Correct)
0.3: Safe programming of PLC using formal verification methods - De Smet, Couffin.. (2000) (Correct)
0.2: Temporal Logic with Past is Exponentially More Succinct - Markey (2003) (Correct)
BibTeX entry: (Update)
@misc{ baudet-random,
author = "Mathieu Baudet",
title = "Random polynomial-time attacks and Dolev-Yao models",
url = "citeseer.ist.psu.edu/article/baudet04random.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
404 A calculus for cryptographic protocols: The Spi calculus - Abadi, Gordon - 1997
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
184 Automated analysis of cryptographic protocols using Mur - Mitchell, Mitchell et al. - 1997
134 The NRL protocol analyzer: An overview - Meadows - 1996
114 A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell et al. - 1998
93 An attack on the Needham-Schroeder public-key authentication.. - Lowe - 1995
76 the computational soundness of formal encryption (context) - Abadi, Rogaway et al. - 2000
56 Formal eavesdropping and its computational interpretation - Abadi, Jurjens - 2001
50 the reachability problem in cryptographic protocols - Amadio, Lugiez - 2000
47 Constraint solving for bounded-process cryptographic protoco.. - Millen, Shmatikov - 2001
35 Analysis of the Internet Key Exchange protocol using the NRL.. - Meadows - 1999
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
29 Security analysis of the Cliques protocols suites - Pereira, Quisquater - 2001
24 Game analysis of abuse-free contract signing - Kremer, Raskin - 2002
23 Towards the formal verification of electronic commerce proto.. - Bolignano - 1997
21 A probabilistic polynomialtime calculus for analysis of cryp.. - Mitchell, Ramanathan et al. - 2001
19 A cryptographically sound security proof of the NeedhamSchro.. - Backes, Pfitzmann - 2003
16 Completeness theorems for the Abadi-Rogaway logic of encrypt.. (context) - Micciancio, Warinschi - 2003
15 Probabilistic bisimulation and equivalence for security anal.. - Ramanathan, Mitchell et al. - 2004
9 cient cryptographic protocol verifier based on Prolog rules (context) - Blanchet - 2001
7 Alternating two-way AC-tree automata (context) - Goubault-Larrecq, Verma - 2002
5 cient infinite-state analysis of security protocols (context) - Huima - 1999
5 Two-way equational tree automata for AC-like theories: decid.. - Verma - 2003
5 Hellman key-agreement scheme in the strand-space model (context) - Herzog, e- - 2003
4 Symbolic protocol analysis with products and Di#e-Hellman ex.. (context) - Millen, Shmatikov - 2003
2 Deciding the security of protocols with Di#e-Hellman exponen.. (context) - Chevalier, Kusters et al. - 2003
2 A computational analysis of the Needham-Schroeder protocol (context) - Warinschi - 2003
2 Markov Decison Processes: Discrete Stochastic Dynamic Progra.. (context) - Puterman - 1994
2 IEEE Transactions on Information Society (context) - Di and, Hellman et al. - 1976
1 Sound computational interpretation of formal encryption with.. - Laud - 2003
1 nements de la resolution et verification de protocoles crypt.. (context) - Roger - 2003
Documents on the same site (http://www.lsv.ens-cachan.fr/Publis/publis-y3-all.php): More
Randomized Finite-State Distributed Algorithms As Markov Chains - Duflot, al. (2001) (Correct)
Verification of Embedded Reactive Fiffo Systems - Herbreteau, Cassez, Finkel, al. (2002) (Correct)
A Kleene/Büchi-like Theorem for Clock Languages - Bouyer, Petit (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC