Security Analysis of Decentralized E-voting Protocols in the Universal Composability Framework

Please enable javascript in your browser.

Rezaei Aliabadi, Mehry | 2015

939 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 49911 (02)
University: Sharif University of Technology
Department: Mathematical Sciences
Advisor(s): Khazaei, Shahram
Abstract:
Designing efficient and secure electronic voting protocols without the presence of trusted authorities, which are known as decentralized voting protocols, is one of the most interesting and challenging problems in cryptography. In these protocols the outcome of the protocol is determined by voters collaborating with each other. Since voting is a significant concept in every society, the correctness and security of voting protocols are important. For security analysis of electronic voting protocols, an intuitive proof is not enough and we require a comprehensive approach that provides provable security. In this thesis, we use universal composition framework to analyze a decentralized e-voting protocol proposed by Hao et al in 2012. This protocol is described in detail and then the ideal functionality that the protocol realizes is determined. Finally, the security of protocol is proved
Keywords:
Ideal Functionality ; Universal Composability Framework ; Electronic Voting ; Decentralized Electronic Voting ; Moltiparty Computation ; Simulation Based Security