Sciweavers

610 search results - page 11 / 122
» Information-theoretically secure protocols and security unde...
Sort
View
81
Voted
CADE
2009
Springer
15 years 10 months ago
Computing Knowledge in Security Protocols under Convergent Equational Theories
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
Stéphanie Delaune, Stefan Ciobâca, St...
CORR
2010
Springer
102views Education» more  CORR 2010»
14 years 9 months ago
How to prevent type-flaw and multi-protocol attacks on security protocols under Exclusive-OR
Type-flaw attacks and multi-protocol attacks on security protocols have been frequently reported in the literature. Heather et al. and Guttman et al. proved that these could be pr...
Sreekanth Malladi
CSFW
2005
IEEE
15 years 3 months ago
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
Martín Abadi, Véronique Cortier
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 9 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
ICALP
2004
Springer
15 years 2 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier