| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Computationally Sound Compositional Logic for Security Protocols
Abstract : We have been developing a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the actions of a malicious attacker. The approach rests on a probabilistic, polynomial-time semantics for a protocol security logic that was originally developed using nondeterministic symbolic semantics. This workshop presentation will discuss ways in which the computational semantics lead to different reasoning methods and report our progress to date in several directions. One significant difference between the symbolic and computational settings results from the computational difference between efficiently recognizing and efficiently producing a value. Among the more recent developments are a compositional method for proving cryptographically sound properties of key exchange protocols, and some work on secrecy properties that illustrates the computational interpretation of inductive properties of protocol roles.
https://hal.inria.fr/inria-00080593
Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Monday, June 19, 2006 - 4:05:27 PM
Last modification on : Friday, January 21, 2022 - 3:09:06 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:04:21 PM
Contributor : Véronique Cortier Connect in order to contact the contributor
Submitted on : Monday, June 19, 2006 - 4:05:27 PM
Last modification on : Friday, January 21, 2022 - 3:09:06 AM
Long-term archiving on: : Monday, April 5, 2010 - 11:04:21 PM