Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] A review of cryptographic electronic voting
A vast number of e-voting schemes including mix-net-based e-voting, homomorphic e-
voting, blind signature-based e-voting, blockchain-based e-voting, post-quantum e-voting …
voting, blind signature-based e-voting, blockchain-based e-voting, post-quantum e-voting …
An overview of end-to-end verifiable voting systems
CONTENTS 8.1 Introduction....................................................... 174 8.2 Security Properties of
Voting Systems.............................. 1768.2. 1 Vote Privacy.............................................. 176 8.2. 2 …
Voting Systems.............................. 1768.2. 1 Vote Privacy.............................................. 176 8.2. 2 …
How not to prove yourself: Pitfalls of the fiat-shamir heuristic and applications to helios
Abstract The Fiat-Shamir transformation is the most efficient construction of non-interactive
zero-knowledge proofs. This paper is concerned with two variants of the transformation that …
zero-knowledge proofs. This paper is concerned with two variants of the transformation that …
SoK: A comprehensive analysis of game-based ballot privacy definitions
We critically survey game-based security definitions for the privacy of voting schemes. In
addition to known limitations, we unveil several previously unnoticed shortcomings …
addition to known limitations, we unveil several previously unnoticed shortcomings …
Attacking and fixing Helios: An analysis of ballot secrecy
Helios 2.0 is an open-source web-based end-to-end verifiable electronic voting system,
suitable for use in low-coercion environments. In this article, we analyse ballot secrecy in …
suitable for use in low-coercion environments. In this article, we analyse ballot secrecy in …
Election verifiability for helios under weaker trust assumptions
Most electronic voting schemes aim at providing verifiability: voters should trust the result
without having to rely on some authorities. Actually, even a prominent voting system like …
without having to rely on some authorities. Actually, even a prominent voting system like …
End-to-end verifiable elections in the standard model
We present the cryptographic implementation of “DEMOS”, a new e-voting system that is end-
to-end verifiable in the standard model, ie, without any additional “setup” assumption or …
to-end verifiable in the standard model, ie, without any additional “setup” assumption or …
[KIRJA][B] Real-world electronic voting: Design, analysis and deployment
Real-World Electronic Voting: Design, Analysis and Deployment captures all major
developments in electronic voting since 2003 in a real-world setting. It covers three broad …
developments in electronic voting since 2003 in a real-world setting. It covers three broad …
On CCA-secure somewhat homomorphic encryption
It is well known that any encryption scheme which supports any form of homomorphic
operation cannot be secure against adaptive chosen ciphertext attacks. The question then …
operation cannot be secure against adaptive chosen ciphertext attacks. The question then …
Election verifiability or ballot privacy: Do we need to choose?
We propose a new encryption primitive, commitment consistent encryption (CCE), and
instances of this primitive that enable building the first universally verifiable voting schemes …
instances of this primitive that enable building the first universally verifiable voting schemes …