154 search results - page 14 / 31 » Cryptographically Sound Theorem Proving |
SP
2008
IEEE
13 years 6 months ago
2008
IEEE
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
As an attempt to uncover the topological nature of composition of strategies in game semantics, we present a "topological" game for Multiplicative Additive Linear Logic ...
IPL
2006
13 years 7 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
LOGCOM
2010
13 years 6 months ago
2010
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...