43 search results - page 1 / 9 » Probabilistic Polynomial-Time Semantics for a Protocol Secur... |
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
IJNSEC
2008
13 years 5 months ago
2008
TCC
2005
Springer
13 years 11 months ago
2005
Springer
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...
CSFW
2006
IEEE
13 years 11 months ago
2006
IEEE
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
TCC
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...