Sciweavers

49 search results - page 2 / 10
» Open Issues in Formal Methods for Cryptographic Protocol Ana...
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
IWFM
2003
13 years 6 months ago
Using Admissible Interference to Detect Denial of Service Vulnerabilities
Meadows recently proposed a formal cost-based framework for analysis of denial of service. It was showed how some principles that have already been used to make cryptographic prot...
Stéphane Lafrance, John Mullins
TYPES
2004
Springer
13 years 10 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
CSE
2009
IEEE
13 years 11 months ago
Ceremonies Formal Analysis in PKI's Context
—Ceremonies are a useful tool to establish trust in scenarios where protocols operate. They describe a greater range of issues not taken into account by protocol designers. We ta...
Jean Everson Martina, Túlio Cicero Salvaro ...
ENTCS
2006
145views more  ENTCS 2006»
13 years 4 months ago
Compositionality of Security Protocols: A Research Agenda
The application of formal methods to security protocol analysis has been extensively researched during the last 25 years. Several formalisms and (semi-)automatic tools for the ver...
Cas J. F. Cremers