10 search results - page 1 / 2 » Composition of Cryptographic Protocols in a Probabilistic Po... |
CONCUR
2003
Springer
13 years 9 months ago
2003
Springer
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
FOSSACS
2008
Springer
13 years 6 months ago
2008
Springer
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...
ENTCS
2007
13 years 4 months ago
2007
When modelling cryto-protocols by means of process calculi which express both nondeterministic and probabilistic behavior, it is customary to view the scheduler as an intruder. It...
CSFW
2005
IEEE
13 years 10 months ago
2005
IEEE
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
CSFW
2008
IEEE
13 years 11 months ago
2008
IEEE
We investigate the composition of protocols that share a common secret. This situation arises when users employ the same password on different services. More precisely we study w...