82 search results - page 1 / 17 » Inductive Proofs of Computational Secrecy |
ESORICS
2007
Springer
13 years 11 months ago
2007
Springer
ASIAN
2006
Springer
13 years 9 months ago
2006
Springer
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
JCS
2010
13 years 4 months ago
2010
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
CCS
2006
ACM
13 years 9 months ago
2006
ACM
ESORICS
2006
Springer
13 years 9 months ago
2006
Springer
Abstract We present a computational analysis of basic Kerberos with and without its public-key extension PKINIT in which we consider authentication and key secrecy properties. Our ...