Please use this identifier to cite or link to this item:
|Title||Using Homomorphic Cryptographic Solutions on E-voting Systems|
|Title in Arabic||استخدام حلول التشفير المثلي في انظمة الاقتراع الالكتروني|
Homomorphic Cryptography raised as a new solution used in electronic voting systems. In this thesis, Fully Homomorphic used to design and implement an e-voting system, for the purpose of examination and studying the applicability in real systems and performance of fully homomorphic encryption in e-voting systems. Most of homomorphic cryptography e-voting systems based on additive or multiplicative homomorphic encryption. In this thesis, fully homomorphic encryption used to provide both operations additive and multiplication, which ease the demonstration of none interactive zero knowledge proof NIZKP. The implemented e-voting systems achieved most of the important security issues of the internet-voting systems such as, eligibility, privacy, accuracy, verifiability, fairness, receipt-freeness, incoercibility, dispute-freeness, robustness, scalability and practicality. One of the most important properties of the implemented internet voting system its applicability to work on cloud infrastructure, while preserving its security characteristics. The implementation is done using homomorphic encryption library HELib, which based on BGV fully homomorphic encryption scheme, written in C++ language. The implemented voting systems divided into three parts: Authentication Server, Voting Server and Voters. Addition and multiplication properties of fully homomorphic encryption used to verify the correctness of vote structure as a NIZKP, and for calculating the results of the voting process in an encrypted way. The results show that the implemented internet voting system is secure and applicable for a large number of voters up to 10 million voter.
|Publisher||الجامعة الإسلامية - غزة|
|Files in this item|