Automated analysis of voting systems with dolev-yao intruder model
This paper presents a novel intruder model for automated reasoning about anonymity
properties of voting systems. We adapt the lazy spy for this purpose, as it avoids the
eagerness of pre-computation of unnecessary deductions, reducing the required state space
for the analysis. This powerful intruder behaves as a Dolev-Yao intruder, which not only
observes a protocol run, but also interacts with the protocol participants, overhears
communication channels, intercepts and spoofs any messages that he has learned or …
properties of voting systems. We adapt the lazy spy for this purpose, as it avoids the
eagerness of pre-computation of unnecessary deductions, reducing the required state space
for the analysis. This powerful intruder behaves as a Dolev-Yao intruder, which not only
observes a protocol run, but also interacts with the protocol participants, overhears
communication channels, intercepts and spoofs any messages that he has learned or …
Abstract
This paper presents a novel intruder model for automated reasoning about anonymity properties of voting systems. We adapt the lazy spy for this purpose, as it avoids the eagerness of pre-computation of unnecessary deductions, reducing the required state space for the analysis. This powerful intruder behaves as a Dolev-Yao intruder, which not only observes a protocol run, but also interacts with the protocol participants, overhears communication channels, intercepts and spoofs any messages that he has learned or generated from any prior knowledge.
eceasst.org
Showing the best result for this search. See all results