Weakening the Dolev-Yao model through probability
conference contribution
posted on 2012-12-20, 15:32 authored by Riccardo Bresciani, Andrew ButterfieldThe Dolev-Yao model has been widely used in protocol verificaion
and has been implemented in many protocol verifiers.
There are strong assumptions underlying this model,
such as perfect cryptography: the aim of the present work is
to propose an approach to weaken this hypothesis, by means
of probabilistic considerations on the strength of crypto-
graphic functions. Such an approach may effectively be implemented in actual protocol verifiers. The Yahalom proto-
col is used as an easy example to show this approach.
History
Publication
SIN '09 Proceedings of the 2nd international conference on Security of information and networks;pp. 293-297Publisher
Association for Computing MachineryNote
peer-reviewedOther Funding information
SFIRights
2009"© ACM. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in SIN '09: Proceedings of the 2nd international conference on Security of information and networks http://dx.doi.org/10.1145/1626195.1626265Language
EnglishExternal identifier
Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC