Reference : On the verifiability of (electronic) exams
Reports : External report
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/25413
On the verifiability of (electronic) exams
English
Dreier, Jannik [> >]
Giustolisi, Rosario [> >]
Kassem, Ali [> >]
Lafourcade, Pascal [> >]
Lenzini, Gabriele mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) >]
2014
Technical Report TR-2014-2, Verimag
[en] Exams ; Formal Verification ; Verifiability ; Applied -Calculus ; ProVerif
[en] The main concern for institutions that organize exams is to detect when students cheat. Actually more frauds are possible and even authorities can be dishonest. If institutions wish to keep exams a trustworthy business, anyone and not only the authorities should be allowed to look into an exam’s records and verify the presence or the absence of frauds. In short, exams
should be verifiable. However, what verifiability means for exams is unclear and no tool to
analyze an exam’s verifiability is available. In this paper we address both issues: we formalize
several individual and universal verifiability properties for traditional and electronic exams,
so proposing a set of verifiability properties and clarifying their meaning, then we implement
our framework in ProVerif, so making it a tool to analyze exam verifiability. We validate our
framework by analyzing the verifiability of two existing exam systems – an electronic and a
paper-and-pencil system.
http://hdl.handle.net/10993/25413

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
On the Verifiability of.pdfPublisher postprint521.76 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.