719 search results - page 35 / 144 » Proving Security Protocols Correct |
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Finding flaws in security protocol implementations is hard. Finding flaws in the implementations of sensor network security protocols is even harder because they are designed to p...
ESSOS
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We present an approach to security requirements engineering, which makes use of special kinds of problem frames that serve to structure, characterize, analyze, and solve ...
JCM
2008
14 years 9 months ago
2008
In wireless ad hoc networks, all its nodes behave as routers and take part in its discovery and maintenance of routes to other nodes. Thus, the presence of selfish or malicious nod...
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
We prove the Needham-Schroeder-Lowe public-key protocol secure under real, active cryptographic attacks including concurrent protocol runs. This proof is based on an abstract crypt...
CTRSA
2008
Springer
14 years 11 months ago
2008
Springer
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...