Sciweavers

199 search results - page 3 / 40
» A survey of algebraic properties used in cryptographic proto...
Sort
View
IPPS
2008
IEEE
13 years 11 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
LPAR
2007
Springer
13 years 10 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
IANDC
2008
105views more  IANDC 2008»
13 years 4 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...
ASM
2008
ASM
13 years 6 months ago
Modelling Attacker's Knowledge for Cascade Cryptographic Protocols
We address the proof-based development of cryptographic protocols satisfying security properties. Communication channels are supposed to be unsafe. Analysing cryptographic protocol...
Nazim Benassa
CORR
2011
Springer
175views Education» more  CORR 2011»
12 years 8 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...