Applying a Dependency Mechanism for Voting Protocol Models Using Event-B

Paul Gibson 1, 2 Souad Kherroubi 3 Dominique Méry 3, 4
1 METHODES-SAMOVAR - Méthodes et modèles pour les réseaux
SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
3 MOSEL - Proof-oriented development of computer-based systems
LORIA - FM - Department of Formal Methods
4 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : The design of e-voting systems requires the use of techniques which guarantee that the resulting system is safe, secure and preserves privacy. We develop Event-B models of a voting system, by applying a decomposition pattern and a technique of contextualisation, using a dependency mechanism. Through refinement, we take into account the precise regulation and structure of a specific voting process, and reason formally about the system’s resistence to common attacks and threats.
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01658423
Contributor : Hal Ifip <>
Submitted on : Thursday, December 7, 2017 - 3:49:08 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:04 PM

File

 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2020-01-01

Please log in to resquest access to the document

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Paul Gibson, Souad Kherroubi, Dominique Méry. Applying a Dependency Mechanism for Voting Protocol Models Using Event-B. 37th International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE 2017), Jun 2017, Neuchâtel, Switzerland. pp.124-138, ⟨10.1007/978-3-319-60225-7_9⟩. ⟨hal-01658423⟩

Share

Metrics

Record views

601