127 search results - page 22 / 26 » Proving Properties of Security Protocols by Induction |
152
click to vote
SEFM
2007
IEEE
16 years 3 days 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...
170
click to vote
ASIACRYPT
2009
Springer
16 years 13 days 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...
169
click to vote
CCS
1994
ACM
15 years 10 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...
140
click to vote
CCS
2009
ACM
16 years 19 days 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...
162
click to vote
ESORICS
2005
Springer
15 years 11 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...