7 search results - page 1 / 2 » Static Analysis with Set-Closure in Secrecy |
PACT
2001
Springer
14 years 1 months ago
2001
Springer
We introduce the νSPI-calculus that strengthens the notion of “perfect symmetric cryptography” of the spi-calculus by taking time into account. This involves defining an oper...
ENTCS
2006
13 years 9 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
WISEC
2010
ACM
14 years 2 months ago
2010
ACM
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
VMCAI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Implementations of cryptographic protocols, such as OpenSSL for example, contain bugs affecting security, which cannot be detected by just analyzing abstract protocols (e...
IJFCS
2007
13 years 9 months ago
2007
In this technical report, we present a process algebra aimed at modelling PKI-based systems. The new language, SPIKY, extends the spi-calculus by adding primitives for the retriev...