216 search results - page 8 / 44 » Models and Proofs of Protocol Security: A Progress Report |
EUROCRYPT
2007
Springer
14 years 26 days ago
2007
Springer
Protocols proven secure within the universal composability (UC) framework satisfy strong and desirable security properties. Unfortunately, it is known that within the “plain” m...
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressive...
SEFM
2007
IEEE
14 years 1 months ago
2007
IEEE
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
EUROCRYPT
2008
Springer
13 years 8 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
ISSE
2010
13 years 1 months ago
2010
In this work, we address the formalisation of symmetric nets, a subclass of coloured Petri nets, refinement in COQ. We first provide a formalisation of the net models, and of thei...