Browse by author
Lookup NU author(s): Professor Feng Hao, Dr Dylan Clarke, Dr Carlton Shepherd
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In this paper, we propose - and have implemented - the first verifiable classroom voting system. The subject of secure classroom voting has so far received almost no attention from the security community. Though several commercial classroom voting systems have been available, none of them is verifiable. State-of-the-art verifiable voting protocols all rely on finding a set of trustworthy tallying authorities (who are essentially cryptographers and computer experts) in the first place, and hence are completely unsuitable for classroom voting. Our system design is based on "self-enforcing e-voting" - a new paradigm that was first presented at SPW'12 (Hao, Randell and Clarke). A self-enforcing e-voting scheme provides the same End-to-End (E2E) verifiability as other e-voting schemes but without involving any tallying authorities. The removal of tallying authorities brings several compelling advantages in real-world voting scenarios - here, classroom voting is just one example. We have piloted the use of the developed verifiable classroom voting system in real classroom teaching. Based on our preliminary trial experience, we believe the system is not only scientifically valuable, but also pedagogically useful. © Springer-Verlag Berlin Heidelberg 2013.
Author(s): Hao F, Clarke D, Shepherd C
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Cambridge International Workshop on Security Protocols
Year of Conference: 2013
Pages: 245-254
Publisher: Springer Verlag
URL: https://doi.org/10.1007/978-3-642-41717-7_28
DOI: 10.1007/978-3-642-41717-7_28
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783642417160
