Privacy-Preserving Verifiability: A Case for an Electronic Exam Protocol

Rosario Giustolisi, Vincenzo Iovino, Gabriele Lenzini

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review


We introduce the notion of privacy-preserving verifiability for security protocols. It holds when a protocol admits a verifiability test that does not reveal, to the verifier that runs it, more pieces of information about the protocol’s execution than those required to run the test. Our definition of privacy-preserving verifiability is general and applies to cryptographic protocols as well as to human security protocols. In this paper we exemplify it in the domain of e-exams. We prove that the notion is meaningful by studying an existing exam protocol that is verifiable but whose verifiability tests are not privacy-preserving. We prove that the notion is applicable: we review the protocol using functional encryption so that it admits a verifiability test that preserves privacy according to our definition. We analyse, in ProVerif, that the verifiability holds despite malicious parties and that the new protocol maintains all the security properties of the original protocol, so proving that our privacy-preserving verifiability can be achieved starting from existing security
Original languageEnglish
Title of host publication14th International Conference on Security and Cryptography (SECRYPT)
PublisherSCITEPRESS Digital Library
Publication date2017
ISBN (Print)978-989-758-259-2
Publication statusPublished - 2017


Dive into the research topics of 'Privacy-Preserving Verifiability: A Case for an Electronic Exam Protocol'. Together they form a unique fingerprint.

Cite this