(Enter summary)
Abstract: Several related research eorts have led to three dierent ways of specifying protocol security
properties by simulation or equivalence. Abstracting the speci
cation conditions away from the
computational frameworks in which they have been previously applied, we show that when asynchronous
communication is used, universal composability, black-box simulatability, and process equivalence express
the same properties of a protocol. Further, the equivalence between these conditions holds for... (Update)
Similar documents based on text: More All
0.3: A Probabilistic Polynomial-Time Calculus for the.. - Mitchell.. (2002)
(Correct)
0.2: A Core Calculus of Classes and Objects - Bono, Patel, Shmatikov, Mitchell (1999)
(Correct)
0.2: Analysis of a Fair Exchange Protocol - Shmatikov, Mitchell (1999)
(Correct)
BibTeX entry: (Update)
A. Datta, R. Kusters, J. C. Mitchell, A. Ramanathan, V. Shmatikov, "Unifying Equivalence-Based Definitions of Protocol Security", in Proc. of Workshop on Issues in the Theory of Security, WITS'04, 2004. http://citeseer.ist.psu.edu/datta04unifying.html More
@misc{ datta04unifying,
author = "A. Datta and R. Kusters and J. Mitchell and A. Ramanathan and V. Shmatikov",
title = "Unifying Equivalence-Based Definitions of Protocol Security",
text = "A. Datta, R. Kusters, J. C. Mitchell, A. Ramanathan, V. Shmatikov, Unifying
Equivalence-Based Definitions of Protocol Security, in Proc. of Workshop
on Issues in the Theory of Security, WITS'04, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/datta04unifying.html" }
Citations (may not include all citations):
189
Universally composable security: A new paradigm for cryptogr..
- Canetti - 2000
74
A model for asynchronous reactive systems and its applicatio..
- tzmann, Waidner - 2001
59
A bisimulation method for cryptographic protocol
- Abadi, Gordon - 1998
56
Universally composable commitments
- Canetti, Fischlin - 2001
46
Probabilistic polynomial-time equivalence and security proto..
- Lincoln, Mitchell et al. - 1999
43
Universally composable two-party and multiparty secure compu..
- Canetti, Lindell et al. - 2002
41
i and Cedric Fournet. Mobile values, new names, and secure .. (context) - Abad - 2001
38
International Series in Computer Science (context) - Milner, Concurrency - 1989
36
Universally composable notions of key exchange and secure ch..
- Canetti, Krawczyk - 2002
30
A calculus for cryptographic protocols: the spi calculus (context) - Abadi, Gordon - 1998
30
A general composition theorem for secure reactive systems
- Backes, tzmann et al. - 2004
26
Predicative Recursion and Computational Complexity
- Bellantoni - 1992
24
A linguistic characterization of bounded oracle computation ..
- Mitchell, Mitchell et al. - 1998
22
Type Systems for Polynomial-Time Computation
- Hofmann - 1999
15
Probabilistic bisimulation and equivalence for security anal..
- Ramanathan, Mitchell et al. - 2003
[Article contains additional citations not shown here]
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