1894 search results - page 95 / 379 » A TLA Proof System |
139
Voted
CSFW
2009
IEEE
15 years 7 months ago
2009
IEEE
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
102
Voted
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
100
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
LF is a dependent type theory in which many other formal systems can be conveniently embedded. However, correct use of LF relies on nontrivial metatheoretic developments such as p...
106
click to vote
CSFW
2006
IEEE
15 years 6 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
118
Voted
RTA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...