Abstract Numerous approaches for cast-as-intended verifiability have been proposed in the literature on electronic voting, balancing practical aspects and security guarantees different ways. One of well-established methods involves use a second device that allows voters to audit their submitted ballots. This approach offers several benefits, including support flexible ballot election types an i...

Consider a weak client that wishes to delegate computation to an untrusted server and be able to succinctly verify the correctness of the result, all within one round of interaction. We provide solutions for two relaxed variants of this problem. Specifically: • We consider a model where the client delegates the computation to two or more servers, and is guaranteed to output the correct answer a...

Our overall aim is to provide a verification framework for practical multi-agent systems. To achieve practicality, we must be able to describe and implement heterogeneous multi-agent systems. To achieve verifiability, we must define semantics appropriately for use in formal verification. Thus, in this paper, we tackle the problem of implementing heterogeneous multi-agent systems in a semantical...

In this paper we extend the threshold secret sharing schemes based on the Chinese remainder theorem in order to deal with more general access structures. Aspects like verifiability, secret sharing homomorphisms and multiplicative properties are also discussed. AMS Subject Classification: 94A62, 11A07

This paper is about secure remote examination. It presents Remark! , an electronic exam protocol which achieves several authentication, (conditional) anonymity, privacy, and verifiability properties without trusted third parties. Remark! is primarily designed for invigilated Internet-based exams but it also fits computer-based exams with candidates taking their exam in classrooms.