Sciweavers

82 search results - page 4 / 17
» Deciding knowledge properties of security protocols
Sort
View
STACS
2007
Springer
14 years 3 months ago
On the Automatic Analysis of Recursive Security Protocols with XOR
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
Ralf Küsters, Tomasz Truderung
CADE
2009
Springer
14 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...
JDCTA
2010
187views more  JDCTA 2010»
13 years 4 months ago
Automatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus
Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance hav...
Bo Meng, Wei Huang, Zimao Li, Dejun Wang
ADHOC
2007
144views more  ADHOC 2007»
13 years 10 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
CADE
2010
Springer
13 years 11 months ago
Automating Security Analysis: Symbolic Equivalence of Constraint Systems
We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity ...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...