Universally composable NIZK protocol in an internet voting scheme

Abstract

We use the Universally Composable (UC) framework to evaluate our Non-Interactive Zero-Knowledge (NIZK) protocol for verifying the validity of the ballot in an Internet voting scheme. We first describe the Internet voting scheme followed by the explanation of the NIZK protocol for ballot verification in that voting scheme. We then define the ideal functionalities using the UC framework and evaluate the NIZK protocol by using these ideal functionalities. We find that this NIZK protocol is secure in the UC framework in the presence of malicious and adaptive adversaries. © 2011 Springer-Verlag.