Stéphanie Delaune. Intruder Deduction Problem in Presence of Guessing Attacks. In Proceedings of the Workshop on Security Protocols Verification (SPV'03), pp. 26–30, Marseilles, France, September 2003.
We present a decidability result in the context of the verification of cryptographic protocols in presence of data which take value in a finite known set. Since the perfect cryptography assumption is unrealistic for cryptographic protocols that employ weak data, we extend the conventional Dolev-Yao model to consider guessing attacks, where an intruder guesses the values of weak data and verify these guesses. We show that the intruder deduction problem, i.e. the existence of guessing attack, can be decided in polynomial time for the extended Dolev-Yao model.
@inproceedings{Del-spv2003,
abstract = {We present a decidability result in the context of
the verification of cryptographic protocols in
presence of data which take value in a finite known
set. Since the perfect cryptography assumption is
unrealistic for cryptographic protocols that employ
weak data, we extend the conventional Dolev-Yao model
to consider guessing attacks, where an intruder
guesses the values of weak data and verify these
guesses. We show that the intruder deduction problem,
i.e. the existence of guessing attack, can be decided
in polynomial time for the extended Dolev-Yao model.},
address = {Marseilles, France},
author = {Delaune, St{\'e}phanie},
booktitle = {{P}roceedings of the {W}orkshop on {S}ecurity
{P}rotocols {V}erification ({SPV}'03)},
editor = {Rusinowitch, Micha{\"e}l},
month = sep,
pages = {26-30},
title = {Intruder Deduction Problem in Presence of Guessing
Attacks},
year = {2003},
acronym = {{SPV}'03},
nmonth = {9},