Universally composable NIZK protocol in an internet voting scheme

Authors:
Md. Abdul Based;Stig Frode Mjølsnes
Affiliations:
Department of Telematics, Norwegian University of Science and Tenchnology;Department of Telematics, Norwegian University of Science and Tenchnology
Venue:
STM'10 Proceedings of the 6th international conference on Security and trust management
Year:
2010

Citing 7
Cited 1

Non-interactive zero-knowledge and its applications

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Commitments

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Analyzing and Improving Internet Voting Protocol

ICEBE '07 Proceedings of the IEEE International Conference on e-Business Engineering
Multiple non-interactive zero knowledge proofs based on a single random string

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Zero-knowledge proofs of knowledge without interaction

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science

A secure internet voting scheme

ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

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.