Cryptology ePrint Archive: Report 2021/1071

Improved Verifiability for BeleniosVS

Thomas Haines and Rajeev Gore

Abstract: The BeleniosVS electronic voting scheme offers an attractive mix of verifiability and privacy properties. Moreover, using the ProVerif protocol-verification tool, BeleniosVS has automatic machine-aided analysis of (end-to-end) verifiability in 96 different threat models with the machine-aided analysis finding proofs in 22 cases and finding attacks in the remaining 74 cases. The high number of threat models covered by ProVerif delivers a much richer security analysis than the norm.

We revisit the BeleniosVS scheme and propose several refinements to the ProVerif security model and scheme which increase the number of threat models in which the scheme has verifiability from 22 to 28. Our new ProVerif security model also implies end-to-end verifiability but the requirements are easier to satisfy. Interestingly, in all six improvements, both the changes to the security model and one or more changes to the scheme are necessary to prove verifiability.

Category / Keywords: cryptographic protocols / Verifiability, Machine-checked proofs, ProVerif, BeleniosVS

Original Publication (in the same form): Sixth International Joint Conference on Electronic Voting

Date: received 17 Aug 2021

Contact author: thomas haines at anu edu au

Available format(s): PDF | BibTeX Citation

Version: 20210823:063026 (All versions of this report)

Short URL: ia.cr/2021/1071


[ Cryptology ePrint archive ]