1106 search results - page 15 / 222 » Automated Design of Security Protocols |
CADE
2005
Springer
14 years 10 months ago
2005
Springer
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...
DAC
2002
ACM
14 years 10 months ago
2002
ACM
WCNC
2008
IEEE
14 years 4 months ago
2008
IEEE
—Secure routing of Mobile Ad-hoc Networks (MANETs) is still a hard problem after years of research. We therefore propose to design a secure routing protocol in a new approach. Th...
SP
1998
IEEE
14 years 2 months ago
1998
IEEE
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...