Voir la notice de l'article provenant de la source Numdam
In the last decade, formal methods have proved their interest when analyzing security protocols. Security protocols require in particular to reason about the attacker knowledge. Two standard notions are often considered in formal approaches: deducibility and indistinguishability relations. The first notion states whether an attacker can learn the value of a secret, while the latter states whether an attacker can notice some difference between protocol runs with different values of the secret. Several decision procedures have been developed so far for both notions but none of them can be applied in the context of e-voting protocols, which require dedicated cryptographic primitives. In this work, we show that both deduction and indistinguishability are decidable in polynomial time for two theories modeling the primitives of e-voting protocols.
@article{ITA_2011__45_3_269_0,
author = {Berrima, Mouhebeddine and Ben Rajeb, Narjes and Cortier, V\'eronique},
title = {Deciding knowledge in security protocols under some e-voting theories},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {269--299},
publisher = {EDP-Sciences},
volume = {45},
number = {3},
year = {2011},
doi = {10.1051/ita/2011119},
mrnumber = {2836490},
zbl = {1223.68016},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ita/2011119/}
}
TY - JOUR AU - Berrima, Mouhebeddine AU - Ben Rajeb, Narjes AU - Cortier, Véronique TI - Deciding knowledge in security protocols under some e-voting theories JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 2011 SP - 269 EP - 299 VL - 45 IS - 3 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ita/2011119/ DO - 10.1051/ita/2011119 LA - en ID - ITA_2011__45_3_269_0 ER -
%0 Journal Article %A Berrima, Mouhebeddine %A Ben Rajeb, Narjes %A Cortier, Véronique %T Deciding knowledge in security protocols under some e-voting theories %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 2011 %P 269-299 %V 45 %N 3 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ita/2011119/ %R 10.1051/ita/2011119 %G en %F ITA_2011__45_3_269_0
Berrima, Mouhebeddine; Ben Rajeb, Narjes; Cortier, Véronique. Deciding knowledge in security protocols under some e-voting theories. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 45 (2011) no. 3, pp. 269-299. doi: 10.1051/ita/2011119
Cité par Sources :