An electronic voting mechanism for fighting bribery and coercion

Wu, Zhen-Yu; Wu, Jhao-Ying; Lin, Sung-Chiang; Wang, Charlotte

doi:10.1016/j.jnca.2013.09.011

Cited by 17 publications

(15 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, we compare the performance of our proposed internet-voting system with related schemes [119], [177], [23], [33], [109], and [169], in terms of machine cycles obtained by simulating experiment on Intel(R) Core(TM) i7-2600K CPU @ 3.4…”

Section: Implementation and Benchmarkmentioning

confidence: 99%

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

Kumar

Chand

2020

IEEE Internet Things J.

View full text Add to dashboard Cite

Elliptic curve cryptography (ECC) is a remarkable mathematical tool that offers the same level of security as traditional public-key cryptography (PKC) with a significantly smaller key size and lower computational requirements. The use of pairing on elliptic curves has emerged as a vibrant field of research that provides enhanced security measures for the next generation of cryptographic systems.This thesis explores using ECC and Pairing-Based Cryptosystems (PBC) as effective mathematical tools for achieving high-security levels with minimal key size and computation cost. Specifically, the research aims to analyze Pairing-Friendly Elliptic Curves (PF-EC) and their practicality in resource-constrained environments. It proposes solutions to some of the limitations of existing applications of pairingbased cryptography.The thesis begins by presenting a comprehensive framework for constructing PF-EC and evaluating the practical security of several families of pairing-friendly curves. The study then explores the limitations of Identity-Based Encryption (IBE), a recognized application of pairing-based cryptography. It proposes mechanisms to address issues such as key escrow, secure key issuing, user slandering, and key abusing problems. The proposed solutions include an Escrow-Free Identity-Based Encryption (EF-IBE) scheme secured against confidentiality and an Escrow-Free Identity-Based Signature (EF-IBS) scheme that is forgeable and secure.Next, the thesis examines the feasibility of Internet-Voting Systems (IVS) and identifies user anonymity and ballot integrity during distribution as the main issues hindering their practical implementation. To address these challenges, the thesis proposes two cryptographic primitives secured under the Computational Diffie-Hellman Problem (CDHP) and the Random Oracle Model (ROM) and implements an Endto-End Verifiable Internet Voting (E2E-VIV) system with batch verifiability using one of the proposed cryptographic protocols.The research also studies the security issues associated with data outsourcing in the cloud and proposes an Identity-Based Blind Signature with a Message Recovery (IDBS-MR) scheme to implement a privacy-preserving data outsourcing mechanism that audits the integrity of stored data for resource-limited devices in cloud computing.Furthermore, the thesis proposes two kinds of Escrow-Free Identity-Based Signcryption (EF-IDSC) schemes and implements a secure peer-to-peer video-on-demand (P2P-VoD) streaming system and a secure cloud-assisted health care system that achieves public verifiability based on the identity-based aggregated signcryption (IDASC) scheme.Finally, the research focuses on realizing an authenticated (anonymous) key agreement protocol in energy-constrained settings and proposes two identity-based authenticated key agreement protocols to obtain a secure session key in health care. The first protocol is a One-Round Three-Party Authenticated Identity-Based Key Agreement Protocol (OR-3PID-KAP). In contrast, the second is an Identity-Based Anonymous Authent...

show abstract

Section: Implementation and Benchmarkmentioning

confidence: 99%

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

Kumar

Chand

2020

IEEE Internet Things J.

View full text Add to dashboard Cite

show abstract

“…Some of the security features usually analyzed in other voting systems (Sampigethaya and Poovendran, 2005;Wu et al, 2014) are: eligibility, privacy, verifiability, accuracy, fairness, incoercibility, mobility and scalability.…”

Section: Discussionmentioning

confidence: 99%

A flexible e-voting scheme for debate tools

García

2016

Computers & Security

View full text Add to dashboard Cite

In order to protect votes, e-voting schemes provide privacy, verifiability and eligibility among other features. Most e-voting systems focus on the vote itself, considering it a fixed and limited piece of data (e.g. choosing from a list of candidates) which has to be encrypted and repeatedly permuted. In recent years, collective decision systems have been developed in which participants can submit proposals, argue and vote. In these systems the information to be protected is variable and plentiful, inaccessible to classic methods. The scheme proposed in this paper has been designed to cover these needs. Using the technique of blind signature, an alias is granted to the user that guarantees privacy. The novelty is that this alias consists of a public key that gives users the ability to encrypt and sign. From this alias users can access to the system and operate as if no privacy were needed, which greatly simplifies the process of voting, validation and counting. In addition, this article details one improvement that makes the scheme resistant to coercion.

show abstract

“…Mix-net is one commonly proposed tool to backup secure electronic voting protocols (Chaum, 1981;Fujioka et al, 1992;Sako & Kilian, 1995;Okamoto, 1997;Ohkubo et al, 1999;Boneh & Golle, 2002;Chaum et al, 2005;Ryan & Schneider, 2006;Ryan et al, 2009;Carroll & Grosu, 2009;Wu et al, 2014). Roughly speaking, mix-net is a set of servers which takes a collection of ciphertexts as input, shuffles and outputs messages that are unlinkable to the incoming ones.…”

Section: Related Workmentioning

confidence: 99%

$Laoco\ddot{o}n$: Scalable and Portable Receipt-free E-voting Protocol without Untappable Channels

Zhang,

Xiong

2019

Preprint

View full text Add to dashboard Cite

Vote-buying and voter-coercion are the impending threats when deploying remote online voting into large scale elections. With a policy of carrot and stick, it will encourage voters to deviate from honest voting strategy and spoil the democratic election. To deal with this problem, many voting protocols proposed their solutions with the notion of receipt-freeness. However, existing receipt-free voting protocols either rely on some impractical assumptions as untappable communication channel, or are burden with heavy voter-side computation and quadratic tallying complexity. In this paper, we present Laoco ön, a brand new cryptographic voting protocol which is practical and light-weight to be deployed in large scale online elections. By taking advantage of proxy re-encryption, our protocol can defend vote-buying attacks. Furthermore, we introduce a new property, candidate-adaptiveness, in electronic voting which refers to as every candidate knows the real-time vote number towards himself, while he knows nothing about others, nor he buys votes. We prove the correctness of our protocol and evaluate the performance with experimental results. Finally we advance some open problems which will be coped in our future work.

show abstract

An electronic voting mechanism for fighting bribery and coercion

Cited by 17 publications

References 18 publications

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

A Secure and Efficient Cloud-Centric Internet-of-Medical-Things-Enabled Smart Healthcare System With Public Verifiability

A flexible e-voting scheme for debate tools

$Laoco\ddot{o}n$: Scalable and Portable Receipt-free E-voting Protocol without Untappable Channels

Contact Info

Product

Resources

About