Sciweavers

82 search results - page 3 / 17
» Deciding knowledge properties of security protocols
Sort
View
CADE
2011
Springer
12 years 9 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
FSTTCS
2003
Springer
14 years 3 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 10 months ago
How to prevent type-flaw attacks on security protocols under algebraic properties
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
Sreekanth Malladi, Pascal Lafourcade
IFIP
2004
Springer
14 years 3 months ago
Decidability of Opacity with Non-Atomic Keys
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
Laurent Mazaré
CONCUR
2005
Springer
14 years 3 months ago
Constraint Solving for Contract-Signing Protocols
Research on the automatic analysis of cryptographic protocols has so far mainly concentrated on reachability properties, such as secrecy and authentication. Only recently it was sh...
Detlef Kähler, Ralf Küsters