9 search results - page 1 / 2 » Automated Symbolic Proofs of Observational Equivalence |
CCS
2008
ACM
13 years 7 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
CSFW
2008
IEEE
13 years 7 months ago
2008
IEEE
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this...
TPHOL
2009
IEEE
14 years 1 days ago
2009
IEEE
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...