Sciweavers

42 search results - page 5 / 9
» A Calculus for Cryptographic Protocols: The Spi Calculus
Sort
View
CCS
2011
ACM
12 years 7 months ago
Trace equivalence decision: negative tests and non-determinism
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
Vincent Cheval, Hubert Comon-Lundh, Stéphan...
CORR
2011
Springer
175views Education» more  CORR 2011»
12 years 11 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...
CSFW
2008
IEEE
14 years 2 months ago
Language Based Secure Communication
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
Michele Bugliesi, Riccardo Focardi
FOSSACS
2008
Springer
13 years 9 months ago
Compositional Methods for Information-Hiding
Protocols for information-hiding often use randomized primitives to obfuscate the link between the observables and the information to be protected. The degree of protection provide...
Christelle Braun, Konstantinos Chatzikokolakis, Ca...
HICSS
2005
IEEE
148views Biometrics» more  HICSS 2005»
14 years 1 months ago
Public-Key-Infrastructure Based on a Peer-to-Peer Network
The goal of a Public-Key-Infrastructure (PKI) is to prove whether a cryptographic public key is authentic for a certain user. This information is crucial for the reliability of as...
Thomas Wölfl