43 search results - page 1 / 9 » Probabilistic Polynomial-Time Semantics for a Protocol Secur... |
167
Voted
ICALP
2005
Springer
16 years 6 days 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 ...
190
click to vote
TCC
2005
Springer
16 years 5 days 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...
189
Voted
CSFW
2006
IEEE
16 years 23 days 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...
196
Voted
TCC
2004
Springer
16 years 1 days 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...