10 search results - page 1 / 2 » Sound Computational Interpretation of Formal Encryption with... |
ICISC
2003
13 years 6 months ago
2003
CCS
2009
ACM
14 years 6 days ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
CSFW
2005
IEEE
13 years 11 months ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
TCC
2004
Springer
13 years 10 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...
CRYPTO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. A significant effort has recently been made to rigorously relate the formal treatment of cryptography with the computational one. A first substantial step in this dire...