127 search results - page 22 / 26 » Proving Properties of Security Protocols by Induction |
SEFM
2007
IEEE
15 years 3 months ago
2007
IEEE
The Mondex Case study is still the most substantial contribution to the Grand Challenge repository. It has been the target of a number of formal verification efforts. Those effor...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
Computational puzzles are mildly difficult computational problems that require resources (processor cycles, memory, or both) to solve. Puzzles have found a variety of uses in secu...
CCS
1994
ACM
15 years 1 months ago
1994
ACM
This paper describes an access control mechanism that enforces at the network level an access control decision that is taken at the application level. The mechanism is based on th...
78
Voted
CCS
2009
ACM
15 years 4 months ago
2009
ACM
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
ESORICS
2005
Springer
15 years 3 months ago
2005
Springer
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...