Sciweavers

1056 search results - page 8 / 212
» A Probabilistic Applied Pi-Calculus
Sort
View
CSFW
2010
IEEE
13 years 10 months ago
Formal Verification of Privacy for RFID Systems
RFID tags are being widely employed in a variety of applications, ranging from barcode replacement to electronic passports. Their extensive use, however, in combination with their ...
Mayla Brusò, Konstantinos Chatzikokolakis, ...
CCS
2005
ACM
14 years 1 months ago
Deciding security of protocols against off-line guessing attacks
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
Mathieu Baudet
ESORICS
2010
Springer
13 years 8 months ago
Election Verifiability in Electronic Voting Protocols
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...
Steve Kremer, Mark Ryan, Ben Smyth
JLP
2008
75views more  JLP 2008»
13 years 7 months ago
Automated verification of selected equivalences for security protocols
In the analysis of security protocols, methods and tools for reasoning about protocol behaviors have been quite effective. We aim to expand the scope of those methods and tools. W...
Bruno Blanchet, Martín Abadi, Cédric...
ENTCS
2007
116views more  ENTCS 2007»
13 years 7 months ago
A Logical Characterisation of Static Equivalence
The work of Abadi and Fournet introduces the notion of a frame to describe the knowledge of the environment of a cryptographic protocol. Frames are lists of terms; two frames are ...
Hans Hüttel, Michael D. Pedersen