Tom Chothia  Home/Search
Context
Related
| lix.polytechnique.fr...pigPaperLong.pdf 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: lix.polytechnique.fr/~tomc/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents an extension of the pi-calculus that can reason about brute force and guessing attacks. We relate new name declarations in the pi-calculus with random sampling in the computational model of security. The scope of a new name can then be expanded at a comparable cost as it would take to guess the randomly sampled value in the computational setting. We provide a syntax and reduction semantics for this system and a function that calculates the cost of a given attack, taking into ... (Update)
Active bibliography (related documents): More All
0.9: Guessing Attacks in the pi-calculus with a Computational.. - Chothia (Correct)
0.6: A Theory of Dictionary Attacks and its Complexity - Delaune, al. (2004) (Correct)
0.6: A Computationally Sound Mechanized Prover for Security Protocols - Blanchet (2005) (Correct)
Similar documents based on text: More All
0.2: An optimized parsing algorithm well suited to RNA folding - Lefebvre (1995) (Correct)
0.2: Approximation Schemes for Metric Minimum Bisection and.. - Vega, Karpinski, Kenyon (Correct)
0.2: Counting points on elliptic curves over F p n using.. - Lercier, Morain (1995) (Correct)
BibTeX entry: (Update)
@misc{ chothia-guessing,
author = "Tom Chothia",
title = "Guessing Attacks in the pi-calculus with a Computational Justification",
url = "citeseer.ist.psu.edu/article/chothia05guessing.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof-systems (context) - Goldwasser, Micali et al. - 1988
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
404 A calculus for cryptographic protocols: The spi calculus - Abadi, Gordon - 1997
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
334 How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
322 Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
137 Laboratory for the Foundations of Computer Science (context) - Milner, pi-calculus et al. - 1991
97 The security of the cipher block chaining message authentica.. - Bellare, Kilian et al. - 2000
95 The security of cipher block chaining - Bellare, Kilian et al. - 1994
88 Protecting poorly chosen secrets from guessing attacks - Gong, Lomas et al. - 1993
76 the computational soundness of formal encryption (context) - Abadi, Rogaway et al. - 2000
66 Timing attacks on implementations of Diffie-Hellman (context) - Kocher - 1996
47 Strand spaces: Proving security protocols correct - Thayer, Herzog et al. - 1999
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al. - 2003
22 Symmetric encryption in a simulatable dolev-yao style crypto.. - Backes, Pfitzmann - 2004
21 A probabilistic polynomial-time calculus for analysis of cry.. - Mitchell, Ramanathan et al. - 2001
21 Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004
21 Symmetric encryption in automatic analyses for confidentiali.. - Laud - 2004
19 A cryptographically sound security proof of the needham-schr.. - Backes, Pfitzmann - 2004
15 Probabilistic bisimulation and equivalence for security anal.. - Ramanathan, Mitchell et al. - 2004
11 A specification language for crypto-protocols based on multi.. - Cervesato - 2001
7 Completing the picture: Soundness of formal encryption in th.. (context) - Janvier, Mazare et al. - 2005
7 Analysing protocols subject to guessing attacks - Lowe - 2002
7 A note on the perfect encryption assumption in a process cal.. (context) - Zunino, Degano - 2004
7 from proceedings of the Royal Society (context) - Burrows, Abadi et al. - 1996
6 Composition of cryptographic protocols in a probabilistic po.. - Mateus, Mitchell et al. - 2003
4 A theory of guessing attacks and its complexity - Delauune, Jacquemard - 2004
4 Computational Soundness for Standard Assumptions of Formal C.. - Herzog - 2004
4 Here is a new tool that finds some new guessing attacks (context) - Corin, Malladi et al. - 2003
1 Hiding names: Private authentication in the applied pi calcu.. - Fournet, Abadi - 2003
1 A computational analysis of the Needham-Schroder (context) - Warinschi - 2003
1 Deciding framed bisimilarity (context) - Huttel - 2002
1 Metrics for action-labelled quantitative transition systems - Deng, Chothia et al. - 2005
1 Analysing password protocol security against off-line dictio.. (context) - Corin, Doumen et al. - 2003
Documents on the same site (http://www.lix.polytechnique.fr/~tomc/): More
The Local Area π-Calculus - Chothia (2003) (Correct)
Abstractions for Fault-Tolerant Global Computing - Chothia, Duggan (2004) (Correct)
Guessing Attacks in the pi-calculus with a Computational.. - Chothia (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