Unit:
Κατεύθυνση Λογική και Θεωρία Αλγορίθμων και ΥπολογισμούLibrary of the School of Science
Author:
Kalogeropoulos Panagiotis
Supervisors info:
Αριστείδης Παγουρτζής, Αναπληρωτής Καθηγητής, ΗΜΜΥ, ΕΜΠ.
Δημήτριος Φωτάκης, Επίκουρος Καθηγητής, ΗΜΜΥ, ΕΜΠ
Άγγελος Κιαγιάς, Αναπληρωτής Καθηγητής, Πληροφορικής και Τηλεπικοινωνιών, ΕΚΠΑ.
Original Title:
Ηλεκτρονικές Ψηφοφορίες Ανθεκτικές σε Εκβιασμούς
Translated title:
Coercion Resistant e-voting.
Summary:
Security and privacy of the vote in most e-voting protocols are based on the inability of the adversary to break the cryptographic tools that are in use. Since the computational power of the adversary is constantly increasing and the storage of every public information for future use is of negligible cost, what is going to happen in a few years when the cryptographic tools break? The current thesis studies e-voting protocols that offer " Everlasting Privacy" and Coercion Resistance". Such properties secure vote privacy against adversaries with infinite computational power and time. They also enable the voter to avoid coercion. Two voting protocols satisfying these properties, are presented along with the cryptographic tools they implement. In the epilogue, we present our attempt for a third e-voting protocol with similar properties.
Main subject category:
Science
Keywords:
Everlasting Privacy, coercion resistance, e-voting
