Log In Sign Up

Secure Internet Exams Despite Coercion

by   Mohammadamin Rakeei, et al.

We study coercion-resistance for online exams. We propose two properties, Anonymous Submission and Single-Blindness which, if hold, preserve the anonymity of the links between tests, test takers, and examiners even when the parties coerce one another into revealing secrets. The properties are relevant: not even Remark!, a secure exam protocol that satisfied anonymous marking and anonymous examiners results to be coercion resistant. Then, we propose a coercion-resistance protocol which satisfies, in addition to known anonymity properties, the two novel properties we have introduced. We prove our claims formally in ProVerif. The paper has also another contribution: it describes an attack (and a fix) to an exponentiation mixnet that Remark! uses to ensure unlinkability. We use the secure version of the mixnet in our new protocol.


page 1

page 2

page 3

page 4


Secure Two-Party Feature Selection

In this work, we study how to securely evaluate the value of trading dat...

Communication over Continuous Quantum Secure Dialogue using Einstein-Podolsky-Rosen States

With the emergence of quantum computing and quantum networks, many commu...

MOPaC: The Multiple Offers Protocol for Multilateral Negotiations with Partial Consensus

Existing protocols for multilateral negotiation require a full consensus...

Constant-Round Linear-Broadcast Secure Computation with Penalties

It is known that Bitcoin enables achieving fairness in secure computatio...

Secure protocol to protect location privacy in distance calculation

Several applications require computing distances between different peopl...

QKD based on symmetric entangled Bernstein-Vazirani

This paper introduces a novel entanglement-based QKD protocol, that make...

The Era of TLS 1.3: Measuring Deployment and Use with Active and Passive Methods

TLS 1.3 marks a significant departure from previous versions of the Tran...