A practical verifiable e-voting protocol for large scale elections over a network

Download

index.pdf

Date

2007-04-13

Author

Cetinkaya, Orhan
Doğanaksoy, Ali

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

99
views

65
downloads

We propose a practical verifiable e-voting protocol which guarantees e-voting requirements: privacy, eligibility, uniqueness, uncoercibility, fairness, accuracy, robustness, individual verifiability, and universal verifiability. Unlike existing e-voting protocols we employ dynamic ballot instead of predefined usual ballot in order to strengthen accuracy and fairness of the protocol. In dynamic ballots, the ordering of candidates in the ballots is dynamically created and changes for each voter. Therefore the proposed protocol is called as “DynaVote”. DynaVote does not use complex cryptographic algorithms such as homomorphic encryption and does not require anonymous communication channels such as mix-nets since it employs PVID (Pseudo-Voter Identity) scheme which relies on blind signature. Besides it has no physical assumption such as untappable channels. Hence, DynaVote is a practical e-voting protocol for large scale elections. DynaVote is performed over a network such as the Internet. In order to achieve uncoercibility, DynaVote allows recasting without sacrificing uniqueness.

URI

https://hdl.handle.net/11511/36261

DOI

https://doi.org/10.1109/ares.2007.15

Collections

Department of Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

A method for detecting RGPO/VGPO jamming Kural, F; Ozkanzanc, Y (2004-04-30) This paper proposes a general approach to detect the presence of deceptive counter measures such as RGPO or VGPO. The method which is based on Kalman filter lays its foundation on drift between Doppler measurement and the Doppler information obtained from the range measurement of a target in track. By measuring this drift by Mahalonobis distance metric and comparing it with a predefined threshold; detection is performed. The performance of the proposed approach is illustrated through a simulation.
An assume guarantee verification methodology for aspect oriented programming Ispir, Mustafa; Betin Can, Aysu (2008-09-19) We propose a modular verification methodology for aspect oriented programs. Aspects are the new modularization units to encapsulate crosscutting concerns and have powerful features whose effects can drastically change software behavior. Having such an impact on behavior requires an automated verification support. In this work we introduce a technique that separately answers two questions: "does the aspect have the provisioned effect?" and "does the base program satisfy the assumptions of the aspect?" To ans...
An efficient RSA public key encryption scheme Aboud, Sattar J.; AL-Fayoumi, Mohammad A.; Al-Fayoumi, Mustafa; Jabbar, Haidar S. (2008-04-09) In this paper, we propose an efficient RSA public key encryption scheme, which is an improved version of original RSA scheme. The proposed RSA encryption scheme is based on linear group over the ring of integer mod a composite modulus n which is the product of two distinct prime numbers. In the proposed scheme the original message and the encrypted message are h x h square matrices with entities in z(n) indicated via l(h,z(n)). Since the original RSA Scheme is a block cipher in which the original message an...
A Formal Framework for Hypergraph-Based User Profiles Tarakci, Hilal; Çiçekli, Fehime Nihan (2014-10-28) In this study, we propose a formal framework for user profile representation with hypergraphs. We exploit the framework to aggregate partial profiles of the individual to obtain a complete, multi-domain user model, since we aim to model the user from several perspectives. We use Freebase commons package concepts as pre-defined domains. The proposed user model is also capable of extracting user domain capsules, which models the user for the domain of interest. Moreover, using a hypergraph data structure resu...
New methods for public key cryptosystems based on XTR AKLEYLEK, SEDAT; KIRLAR, Barış Bülent (2015-12-01) In this paper, we propose novel deterministic and probabilistic public key cryptographic schemes based on an effective and compact subgroup trace representation cryptosystem to handle with the problem of secure and efficient communication between the server and resource-constrained device. The proposed schemes use the hardness of the Trace-discrete logarithmic like problem. We also show that the deterministic version of the proposed scheme is a one-way trapdoor, and the probabilistic version of the proposed...

Citation Formats

O. Cetinkaya and A. Doğanaksoy, “A practical verifiable e-voting protocol for large scale elections over a network,” 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36261.