CSFW
2012
IEEE
11 years 7 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
CCS
2011
ACM
12 years 4 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
ENTCS
2006
13 years 4 months ago
2006
In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the pro...
CADE
2010
Springer
13 years 5 months ago
2010
Springer
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
CSFW
2009
IEEE
13 years 11 months ago
2009
IEEE
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...