P. Mateus, J. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In CONCUR 2003, LNCS 2761, pages 327--349. Springer, Sept. 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Probabilistic Polynomial-Time Calculus for the.. - Mitchell.. (2002) (12 citations) Self-citation (Mitchell Scedrov) (Correct)
No context found.
Mateus, P., Mitchell, J. C., and Scedrov, A. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In 14th International Conference on Concurrency Theory (Marseille, France, 2003), R. M. Amadio and D. Lugiez, Eds., vol. 2761 of Lecture Notes in Computer Science, Springer-Verlag, pp. 327--349.
Probabilistic Bisimulation and Equivalence for.. - Ramanathan.. (2004) (6 citations) Self-citation (Mitchell Scedrov) (Correct)
No context found.
Mateus, P., Mitchell, J. C., and Scedrov, A. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In 14th International Conference on Concurrency Theory (Marseille, France, 2003), R. M. Amadio and D. Lugiez, Eds., vol. 2761 of Lecture Notes in Computer Science, Springer-Verlag, pp. 327--349.
Automated Security Proofs with Sequences of Games - Blanchet, Pointcheval (2006) (Correct)
No context found.
P. Mateus, J. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In CONCUR 2003, LNCS 2761, pages 327--349. Springer, Sept. 2003.
A Computationally Sound Mechanized Prover for Security Protocols - Blanchet (2005) (3 citations) (Correct)
No context found.
P. Mateus, J. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomialtime process calculus. In R. Amadio and D. Lugiez, editors, CONCUR 2003 - Concurrency Theory, 14-th International Conference, volume 2761 of Lecture Notes on Computer Science, pages 327--349, Marseille, France, Sept. 2003. Springer.
Guessing Attacks in the pi-calculus with a Computational.. - Chothia (2005) (Correct)
No context found.
P. Mateus, J.C. Mitchell, and A. Scedroc. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In CONCUR 2003 - Concurrency Theory, 14-th International Conference, Marseille, France, September, 2003.
Computational Soundness for Standard Assumptions of Formal.. - Herzog (2004) (3 citations) (Correct)
No context found.
P. Mateus, J.C. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In Roberto M. Amadio and Denis Lugiez, editors, Proceedings, 14th International Conference on Concurrency Theory, volume 2761 of Lecture Notes in Computer Science, pages 323--345. Springer, 2003.
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