Framework for practical and receipt‐free remote voting

Xia, Zhe; Tong, Zheng; Xiao, Min; Chang, Chin‐Chen

doi:10.1049/iet-ifs.2017.0213

Cited by 4 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Protocols based on homomorphic encryption (Benaloh & Tuinstra, 1994;Sako & Kilian, 1995;Hirt & Sako, 2000;Chow et al, 2008;Wen & Buckland, 2009;Yi & Okamoto, 2013;Xia et al, 2018) share the same vulnerability with those based on mix-net in achieving receipt-freeness. Different from mix-net based protocols which are more suitable for elections with multiple candidates, homomorphic encryption based protocols are recommended to be deployed in "YES/NO" voting due to its linear growth cost related to the number of candidates (Aditya et al, 2003).…”

Section: Related Workmentioning

confidence: 99%

“…By using the mask, vote-buyers are blocked from the voting process. However, a recent study (Xia et al, 2018) showed that Masked Ballot is vulnerable to shifting vote attack and proposed an improvement based on it.…”

Section: Related Workmentioning

confidence: 99%

“…Their proposal has been the most practical receipt-free protocol hitherto and was implemented to the real world later (Clarkson et al, 2008). Even so, there are still defects on its quadratic complexity in tallying procedure (Araujo et al, 2010;Spycher et al, 2011) and the excessively heavy voter-side computation (Xia et al, 2018).…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

$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

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

$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

show abstract

“…Receipt-freeness refers to the incapability of a voter to prove that he voted in a certain approach to any attackers with remained verifiability. Generally there exist two cryptographic tools to achieve receipt-freeness: homomorphic encryption [20][21][22][23][24] and Mix-net [25][26][27][28][29][30][31][32].…”

Section: Introductionmentioning

confidence: 99%

“…Moreover, both the increases in the block size and chain length aggravate the time cost of retrieving for a certain block in the blockchain. In [24], the authors introduced a framework for practical and receipt-free remote voting. However, their scheme has two limitations.…”

Section: Introductionmentioning

confidence: 99%

Efficient Proxy Re-encryption Scheme for E-Voting System

2021

KSII TIIS

View full text Add to dashboard Cite

With the development of information and communication technologies, especially wireless networks and cell phones, the e-voting system becomes popular as its cost-effectiveness, swiftness, scalability, and ecological sustainability. However, the current e-voting schemes are faced with the problem of privacy leakage and further cause worse vote-buying and votercoercion problems. Moreover, in large-scale voting, some previous e-voting system encryption scheme with pairing operation also brings huge overhead pressure to the voting system. Thus, it is a vital problem to design a protocol that can protect voter privacy and simultaneously has high efficiency to guarantee the effective implementation of e-voting. To address these problems, our paper proposes an efficient unidirectional proxy re-encryption scheme that provides the re-encryption of vote content and the verification of users' identity. This function can be exactly applied in the e-voting system to protect the content of vote and preserve the privacy of the voter. Our proposal is proven to be CCA secure and collusion resistant. The detailed analysis also shows that our scheme achieves higher efficiency in computation cost and ciphertext size than the schemes in related fields.

show abstract