首页/论文/1908.09170

arXiv 1908.091702019-08cs.CR

An Attack on the the Encryption Scheme of the Moscow Internet Voting System

Alexander Golovnev

备注：: This paper has been superseded by arXiv:1908.05127v2 (merged from arXiv:1908.09170 and arXiv:1908.05127)

英文摘要：

The next Moscow City Duma elections will be held on September 8th with an option of Internet voting. Some source code of the voting system is posted online for public testing. Pierrick Gaudry recently showed that due to the relatively small length of the key, the encryption scheme could be easily broken. This issue has been fixed in the current version of the voting system. In this note we show that the new implementation of the ElGamal encryption system is not semantically secure. We also demonstrate how this newly found security vulnerability can be potentially used for counting the number of votes cast for a candidate.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Breaking the encryption scheme of the Moscow Internet voting system

In September 2019, voters for the election at the Parliament of the city of Moscow were allowed to use an Internet voting system. The source code of it had been made available for public testing. In this paper we show two successful attacks on the encryption scheme implemented in the voting system. Both attacks were sent to the developers of the system, and both issues had been fixed after that.The encryption used in this system is a variant of ElGamal over finite fields. In the first attack we show that the used key sizes are too small. We explain how to retrieve the private keys from the pub…

2019-11-15cs.CR

E-voting System Using Homomorphic Encryption and Blockchain Technology to Encrypt Voter Data

Homomorphic encryption and blockchain technology are regarded as two significant technologies for improving e-voting systems. In this paper, we suggest a novel e-voting system using homomorphic encryption and blockchain technology that is focused on encrypting voter data. By encrypting voter information rather than cast votes, the system enables various statistical analyses regarding the vote result while securing the credibility, privacy, and verifiability of overall e-voting system. We checked the efficiency of the overall system by comparing the speed of the proposed system with the speed o…

2021-11-06cs.CR

An Incoercible E-Voting Scheme Based on Revised Simplified Verifiable Re-encryption Mix-nets

Simplified verifiable re-encryption mix-net (SVRM) is revised and a scheme for e-voting systems is developed based on it. The developed scheme enables e-voting systems to satisfy all essential requirements of elections. Namely, they satisfy requirements about privacy, verifiability, fairness and robustness. It also successfully protects voters from coercers except cases where the coercers force voters to abstain from elections. In detail, voters can conceal correspondences between them and their votes, anyone can verify the accuracy of election results, and interim election results are conceal…

2015-12-17cs.CR

Benaloh's Dense Probabilistic Encryption Revisited

In 1994, Josh Benaloh proposed a probabilistic homomorphic encryption scheme, enhancing the poor expansion factor provided by Goldwasser and Micali's scheme. Since then, numerous papers have taken advantage of Benaloh's homomorphic encryption function, including voting schemes, computing multi-party trust privately, non-interactive verifiable secret sharing, online poker... In this paper we show that the original description of the scheme is incorrect, possibly resulting in ambiguous decryption of ciphertexts. We give a corrected description of the scheme and provide a complete proof of correc…

2010-09-14cs.CR

Secret Sharing Homomorphism and Secure E-voting

Secure E-voting is a challenging protocol. Several approaches based on homomorphic crypto systems, mix-nets blind signatures are proposed in the literature .But most of them need complicated homomorphic encryption which involves complicated encryption decryption process and key management which is not efficient. In this paper we propose a secure and efficient E-voting scheme based on secret sharing homomorphism. Here E-voting is viewed as special case of multi party computation where several voters jointly compute the result without revealing his vote. Secret sharing schemes are good alternati…

2016-02-17cs.CR

一种使用 QKD、双密钥对称加密和可验证收据的量子安全投票框架

A Quantum-Secure Voting Framework Using QKD, Dual-Key Symmetric Encryption, and Verifiable Receipts

本文提出融合 QKD、双密钥对称加密与可验证收据的量子安全投票框架，并通过 MQTT 模拟量子与经典信道，验证其低延迟、低错误率的高效大规模投票处理能力。

2025-10-03cs.CRquant-ph

更多相关论文收起更多论文

使用纸质选票的安全远程投票

Secure Remote Voting Using Paper Ballots

互联网投票可能是未来信息社会最重要的成就之一。它将对选举进程产生巨大影响，使其快速、可靠和廉价。然而，到目前为止，远程投票被认为是非常困难的，因为人们必须考虑到选民的PC对各种网络攻击的敏感性。因此，大部分的研究工作都投入到开发投票站电子投票的协议和机器上。虽然这些解决方案产生了良好的效果，但由于安全平台的问题，它们不能直接用于互联网投票。然而，他们使用的加密组件可能非常有用。本文提出了一种基于混合网和同态加密相结合的方案，借鉴了健壮的投票站投票，以及推荐的远程投票技术-代码表和测试选票。该协议试图通过让投票人负责手动加密他的投票来最大限度地减少对投票人PC的信任。为了实现这一点，选民获得一张纸质选票，允许他通过执行简单的操作（在表中查找）来扰乱投票。纸质选票的创建以及选票的解密由一组合作的可信服务器执行。因此，该方案的特点是强非对称性-所有计算都在服务器端进行。因此，它不需要任何额外的硬件在选民的一方，并提供分布式信任，收据自由和可验证性。

2008-04-15cs.CR

Coercion-Resistant Voting in Linear Time via Fully Homomorphic Encryption: Towards a Quantum-Safe Scheme

We present an approach for performing the tallying work in the coercion-resistant JCJ voting protocol, introduced by Juels, Catalano, and Jakobsson, in linear time using fully homomorphic encryption (FHE). The suggested enhancement also paves the path towards making JCJ quantum-resistant, while leaving the underlying structure of JCJ intact. The exhaustive, comparison-based approach of JCJ using plaintext equivalence tests leads to a quadratic blow-up in the number of votes, which makes the tallying process rather impractical in realistic settings with a large number of voters. We show how the…

2019-02-05cs.CCcs.CRcs.DS

FASTEN: Fair and Secure Distributed Voting Using Smart Contracts

Electing democratic representatives via voting has been a common mechanism since the 17th century. However, these mechanisms raise concerns about fairness, privacy, vote concealment, fair calculations of tally, and proxies voting on their behalf for the voters. Ballot voting, and in recent times, electronic voting via electronic voting machines (EVMs) improves fairness by relying on centralized trust. Homomorphic encryption-based voting protocols also assure fairness but cannot scale to large scale elections such as presidential elections. In this paper, we leverage the blockchain technology o…

2021-02-21cs.CR

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

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 pres…

2019-05-14cs.CR

secrecy 和可验证性：电子投票入门

Secrecy and Verifiability: An Introduction to Electronic Voting

School of Mathematics and Statistics, University of Melbourne（墨尔本大学数学与统计学院）

本文介绍了电子投票中保密性和可验证性的核心概念及现代密码学方法。

2026-02-12cs.CR

克服2024年墨西哥联邦选举中同态加密的瓶颈

Overcoming Bottlenecks in Homomorphic Encryption for the 2024 Mexican Federal Election

针对2024年墨西哥联邦选举境外在线投票场景，本文介绍保障其安全的技术与密码工具，实现INE在选举结束后几分钟内生成可验证结果，并阐述方案向全国性选举的扩展方法。

2025-04-14cs.CRcs.DCmath.NT

BVOT: Self-Tallying Boardroom Voting with Oblivious Transfer

A boardroom election is an election with a small number of voters carried out with public communications. We present BVOT, a self-tallying boardroom voting protocol with ballot secrecy, fairness (no tally information is available before the polls close), and dispute-freeness (voters can observe that all voters correctly followed the protocol). BVOT works by using a multiparty threshold homomorphic encryption system in which each candidate is associated with a masked unique prime. Each voter engages in an oblivious transfer with an untrusted distributor: the voter selects the index of a prime a…

2020-10-06cs.CR

匿名公钥量子货币与量子投票

Anonymous Public-Key Quantum Money and Quantum Voting

本文提出首个满足隐私定义的公钥量子货币方案，并利用不可克隆原理构建量子投票方案，同时引入强正确性公开可重随机化加密工具。

2024-11-07cs.CRquant-ph