154 search results - page 24 / 31 » Cryptographically Sound Theorem Proving |
CCS
2007
ACM
14 years 1 months ago
2007
ACM
er presents a novel approach for concisely abstracting authentication s and for subsequently analyzing those abstractions in a sound manner, i.e., deriving authentication guarante...
ESOP
2004
Springer
14 years 1 months ago
2004
Springer
We show how to combine trust management theories with nonce-based cryptographic protocols. The strand space framework for protocol analysis is extended by associating formulas from...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
ENTCS
2007
13 years 7 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...