| Title |
Vienos elektroninio balsavimo sistemos analizė ir modifikavimas / |
| Translation of Title |
Analysis and modification of one electronic voting system. |
| Authors |
Šimkutė, Aistė |
| Full Text |
|
| Pages |
76 |
| Keywords [eng] |
electronic voting ; unique sum ; diofantine equation |
| Abstract [eng] |
The aim of this paper is to modify two choice electronic voting system to more choices system. Chosen system is published by Cao Gang and called “An electronic voting scheme based on secure multi-party computation“. At this system the sum and result is determined by millionaire’s problem. The result contains the numbers assigned for candidates. When there are just two choices and fixed number of voters the sum of result is always unique. In modified system there are possibility that sum could be inconclusively. Therefore, we must establish requirements for unique sum. These requirements are found by empirical method using created software. Security analysis of original and modified systems is performed. Both systems security requirements are the same. The eligibility, uniqueness and fairness are ensured completely. Verifiability is guaranteed partly. The privacy of voter is ensured then we establish some additional requirements for values that are used by conceal vote. Those values must be not less than the biggest value of candidate. Accuracy and integrality can be breached. We cannot use the millionaire’s problem to find a result of election. For that reason there is used brute force search, an algorithm to solve diofantine linear equation and integer division. There is founded that diofantine linear equation algorithm is not eligible for result finding. The most effective method is integer division. |
| Dissertation Institution |
Kauno technologijos universitetas. |
| Type |
Master thesis |
| Language |
Lithuanian |
| Publication date |
2016 |
