Toggle Main Menu Toggle Search

Open Access padlockePrints

Performability of a secure electronic voting algorithm

Lookup NU author(s): Dr Nigel Thomas


Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


This paper considers modelling the performance and reliability of a secure electronic voting scheme. The scheme provides secure verifiable blind voting, however there is a considerable administration overhead to this level of security. A Markovian process algebra is used to build a performance model of a basic system of n distributed voters. This model is shown to suffer from the familiar state space explosion problem. A simpler model is therefore developed to allow larger and more practically relevant systems to be studied. The original model is then extended to include the possibility that voters may fail and two modes of recovery are considered. The models are evaluated numerically using data obtained from measuring an implementation of this scheme in order to determine the accuracy of the approximations. © 2005 Elsevier B.V. All rights reserved.

Publication metadata

Author(s): Thomas N

Publication type: Article

Publication status: Published

Journal: Electronic Notes in Theoretical Computer Science

Year: 2005

Volume: 128

Issue: 4

Pages: 45-58

ISSN (print): 1571-0661

ISSN (electronic):

Publisher: Elsevier BV


DOI: 10.1016/j.entcs.2005.01.012


Altmetrics provided by Altmetric