A. Ramanathan, J. Mitchell, A. Scedrov, V. Teague  Home/Search
Context Related
| stanford.edu/people/j...ppcfossacs.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: stanford.edu/peopl...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that justifies an equational proof system. (Update)
Cited by: More
Towards a Formal Treatment of Secrecy against.. - Troina, Aldini, Gorrieri (Correct)
On the Relationships between Notions of.. - Datta, Küsters.. (2006) (Correct)
A Probabilistic Hoare-style Logic for Cryptographic Proofs - Corin, den Hartog (2005) (Correct)
Active bibliography (related documents): More All
2.3: A Probabilistic Polynomial-Time Calculus for the.. - Mitchell.. (2002) (Correct)
0.9: A Probabilistic Polynomial-Time Calculus for the.. - Mitchell, Ramanathan, .. (2002) (Correct)
0.6: A Probabilistic Polynomial-Time Calculus for Analysis of.. - Mitchell, al. (2001) (Correct)
Similar documents based on text: More All
0.3: Computational Aspects of Linear Logic - Lincoln (1992) (Correct)
0.2: Seminar on Linear Logic and Application - Suggested Topics - Pfenning, al. (Correct)
0.2: Probabilistic Polynomial-Time Equivalence and Security .. - Lincoln, Mitchell.. (1999) (Correct)
Related documents from co-citation: More All
12: Universally composable security: A new paradigm for cryptographic protocols - Canetti - 2001
10: A probabilistic polynomialtime calculus for analysis of cryptographic protocols - Mitchell, Ramanathan et al. - 2001
9: A calculus for cryptographic protocols: The spi calculus - Abadi, Gordon - 1997
BibTeX entry: (Update)
A. Ramanathan, J. C. Mitchell, A. Scedrov, and V. Teague. Probabilistic bisimulation and equivalence for security analysis of network protocols. In FOSSACS 2004. http://citeseer.ist.psu.edu/ramanathan04probabilistic.html More
@misc{ ramanathan04probabilistic,
author = "A. Ramanathan and J. Mitchell and A. Scedrov and V. Teague",
title = "Probabilistic bisimulation and equivalence for security analysis of network
protocols",
text = "A. Ramanathan, J. C. Mitchell, A. Scedrov, and V. Teague. Probabilistic
bisimulation and equivalence for security analysis of network protocols.
In FOSSACS 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/ramanathan04probabilistic.html" }
Citations (may not include all citations):1065 Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 2001
450 Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
428 IEEE Transactions on Information Theory (context) - Diffie, Hellman - 1976
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali
404 A calculus for cryptographic protocols: the spi calculus - Abadi, Gordon
339 Theory and applications of trapdoor functions (context) - Yao - 1982
322 Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996
302 A logic of authentication - Burrows, Abadi et al.
260 Relations among notions of security for public-key encrytion.. (context) - Bellare, Desai et al.
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998
247 Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
202 International Series in Computer Science (context) - Milner - 1989
189 Universally composable security: A new paradigm for cryptogr.. - Canetti
186 A public key cryptosystem and a signature scheme based on di.. (context) - Gamal - 1985
184 Automated analysis of cryptographic protocols using Mur - Mitchell, Mitchell et al. - 1997
179 Security and composition of multiparty cryptographic protoco.. - Canetti - 2000
143 Proving properties of security protocols by induction - Paulson - 1997
121 Three systems for cryptographic protocol analysis (context) - Kemmerer, Meadows et al. - 1994
114 A probabilistic poly-time framework for protocol analysis - Lincoln, Mitchell et al. - 1998
104 A meta-notation for protocol analysis - Cervesato, Durgin et al. - 1999
98 Security properties and CSP - Schneider - 1996
97 the security of public-key protocols (context) - Dolev, Yao - 1981
89 the security of El Gamal-based encryption - Tsiounis, Yung - 1998
87 The decision Di#e-Hellman problem (context) - Boneh - 1998
77 Composition and integrity preservation of secure reactive sy.. - Pfitzmann, Waidner
75 A tutorial on EMPA: A theory of concurrent processes with no.. - Bernardo, Gorrieri - 1998
74 A model for asynchronous reactive systems and its applicatio.. - Pfitzmann, Waidner - 2001
55 Analyzing the Needham-Schroeder public-key protocol: A compa.. - Meadows - 1996
55 The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988
54 Cambridge University Press (context) - Goldreich - 2001
50 Bisimulation for labelled Markov processes - Desharnais, Edalat et al. - 2002
48 Mechanized proofs for a recursive authentication protocol - Paulson - 1997
46 Probabilistic polynomial-time equivalence and security proto.. - Lincoln, Mitchell et al. - 1999
44 Quantitative analysis and model checking - Huth, Kwiatkowska - 1997
43 Probabilistic Proofs and Pseudorandomness (context) - Goldreich - 1999
38 Analytica-A theorem prover in Mathematica - Clarke, Zhao - 1992
36 Universally composable notions of key exchange and secure ch.. - Canetti, Krawczyk
32 Lecture Notes on Cryptography - Goldwasser, Bellare
28 A framework for reasoning about time and reliability (context) - Hansson, Jonsson - 1989
27 Princeton Computer Science Notes (context) - Luby - 1996
26 Predicative Recursion and Computational Complexity - Bellantoni - 1992
26 Universal composition with joint state - Canetti, Rabin
26 Universal composition with joint state - Canetti, Rabin
24 A compositional logic for protocol correctness - Durgin, Mitchell et al. - 2001
24 A linguistic characterization of bounded oracle computation .. - Mitchell, Mitchell et al. - 1998
23 and stratified models of probabilistic processes (context) - van Glabbeek, Smolka et al. - 1995
22 Type Systems for Polynomial-Time Computation - Hofmann - 1999
21 A probabilistic polynomial-time calculus for the analysis of.. - Mitchell, Ramanathan et al.
13 An improved pseudo-random generator based on discrete log - Gennaro
12 Time and Probabilities in Formal Design of Distributed Syste.. (context) - Hansson - 1994
9 Temporal logics for the specification of performance and rel.. - de Alfaro - 1997
7 and secure communication (context) - Abadi, Fournet - 2001
6 Composition of cryptographic protocols in a probabilistic po.. - Mateus, Mitchell et al. - 2003
6 CRC Press LLC (context) - Atallah - 1999
5 Modeling and verifying key-exchange protocols using CSP and .. (context) - Roscoe - 1995
2 Manuscript under preparation; latest version available at ht.. (context) - Goldreich - 2003
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.stanford.edu/people/jcm/publications.htm): More
A Core Calculus of Classes and Mixins - Bono, Patel, Shmatikov (1999) (Correct)
Analysis of a Fair Exchange Protocol - Shmatikov, Mitchell (1999) (Correct)
Relating Strands and Multiset Rewriting for.. - Cervesato.. (2000) (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