Monitoring Electronic Exams

Universities and other educational organizations are adopting computer-based assessment tools (herein called e-exams) to reach larger and ubiquitous audiences. While this makes examination tests more accessible, it exposes them to unprecedented threats not only from candidates but also from authorities, which organize exams and deliver marks. Thus, e-exams must be checked to detect potential irregularities. In this paper, we propose several monitors, expressed as Quantified Event Automata (QEA), to monitor the main properties of e-exams. Then, we implement the monitors using MarQ, a recent Java tool designed to support QEAs. Finally, we apply our monitors to logged data from real e-exams conducted by Universite Joseph Fourier at pharmacy faculty, as a part of Epreuves Classantes Nationales informatisees, a pioneering project which aims to realize all french medicine exams electronically by 2016. Our monitors found discrepancies between the specification and the implementation.

[1]  Ralf Küsters,et al.  Accountability: definition and relationship to verifiability , 2010, CCS '10.

[2]  Bruno Blanchet,et al.  An efficient cryptographic protocol verifier based on prolog rules , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[3]  Pascal Lafourcade,et al.  Defining verifiability in e-auction protocols , 2013, ASIA CCS '13.

[4]  David E. Rydeheard,et al.  MarQ: Monitoring at Runtime with QEA , 2015, TACAS.

[5]  Ezio Bartocci,et al.  First International Competition on Software for Runtime Verification , 2014, RV.

[6]  Felix Klaedtke,et al.  Scalable Offline Monitoring , 2014, RV.

[7]  Runtime Verification , 2010, Lecture Notes in Computer Science.

[8]  Gabriele Lenzini,et al.  Formal analysis of electronic exams , 2014, 2014 11th International Conference on Security and Cryptography (SECRYPT).

[9]  Gabriele Lenzini,et al.  A Framework for Analyzing Verifiability in Traditional and Electronic Exams , 2015, ISPEC.

[10]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[11]  Mark Ryan,et al.  Election Verifiability in Electronic Voting Protocols , 2010, ESORICS.

[12]  Yliès Falcone,et al.  You Should Better Enforce Than Verify , 2010, RV.

[13]  Giles Reger,et al.  Automata based monitoring and mining of execution traces , 2014 .

[14]  Michael Backes,et al.  Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus , 2008, 2008 21st IEEE Computer Security Foundations Symposium.

[15]  Gordon J. Pace,et al.  Fast-Forward Runtime Monitoring - An Industrial Case Study , 2012, RV.

[16]  Nataliya Guts,et al.  Reliable Evidence: Auditability by Typing , 2009, ESORICS.

[17]  Howard Barringer,et al.  Quantified Event Automata: Towards Expressive and Efficient Runtime Monitors , 2012, FM.