239 search results - page 2 / 48 » Proof Techniques for Cryptographic Processes |
IEEEARES
2008
IEEE
13 years 11 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
FCT
2003
Springer
13 years 10 months ago
2003
Springer
We develop new proof techniques, based on non-interference, for the analysis of safety and liveness properties of cryptographic protocols expressed as terms of the process algebra ...
VMCAI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. This paper presents history-dependent scheduling, a new technique for reducing the search space in the verification of cryptographic protocols. This technique allows the...
CSFW
2005
IEEE
13 years 10 months ago
2005
IEEE
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...
CSFW
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...