Enhanced Anonymous Credentials for E-Voting Systems
- URL: http://arxiv.org/abs/2511.10265v1
- Date: Fri, 14 Nov 2025 01:42:21 GMT
- Title: Enhanced Anonymous Credentials for E-Voting Systems
- Authors: Tomasz Truderung,
- Abstract summary: A simple and practical method for achieving everlasting privacy in e-voting systems is to use anonymous voter credentials.<n>This paper considers a simple augmentation to the anonymous credential mechanism, using perfectly hiding commitments to link such credentials to the voter identities.<n>It ensures that published ballots remain unlinkable to voter identities, yet enables necessary consistency checks during ballot casting and ballot auditing.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A simple and practical method for achieving everlasting privacy in e-voting systems, without relying on advanced cryptographic techniques, is to use anonymous voter credentials. The simplicity of this approach may, however, create some challenges, when combined with other security features, such as cast-as-intended verifiability with second device and second-factor authentication. This paper considers a simple augmentation to the anonymous credential mechanism, using perfectly hiding commitments to link such credentials to the voter identities. This solution strengthens the binding between voters and their credentials while preserving everlasting privacy. It ensures that published ballots remain unlinkable to voter identities, yet enables necessary consistency checks during ballot casting and ballot auditing
Related papers
- Beyond Inference Intervention: Identity-Decoupled Diffusion for Face Anonymization [55.29071072675132]
Face anonymization aims to conceal identity information while preserving non-identity attributes.<n>We propose textbfIDsuperscript2Face, a training-centric anonymization framework.<n>We show that IDtextsuperscript2Face outperforms existing methods in visual quality, identity suppression, and utility preservation.
arXiv Detail & Related papers (2025-10-28T09:28:12Z) - Are Voters Willing to Collectively Secure Elections? Unraveling a Practical Blockchain Voting System [0.0]
This paper proposes the concept of collectively secure voting, in which voters themselves can opt in as secret holders to protect ballot secrecy.<n>A practical blockchain-based collectively secure voting system is designed and implemented.<n>Results show a high willingness to act as secret holders, reliable participation in share release, and high security confidence in the proposed system.
arXiv Detail & Related papers (2025-10-09T18:02:40Z) - VoxGuard: Evaluating User and Attribute Privacy in Speech via Membership Inference Attacks [51.68795949691009]
We introduce VoxGuard, a framework grounded in differential privacy and membership inference.<n>For attributes, we show that simple transparent attacks recover gender and accent with near-perfect accuracy even after anonymization.<n>Our results demonstrate that EER substantially underestimates leakage, highlighting the need for low-FPR evaluation.
arXiv Detail & Related papers (2025-09-22T20:57:48Z) - Inference Attacks on Encrypted Online Voting via Traffic Analysis [19.653420340564946]
We examine how adversaries can exploit metadata from encrypted network traffic to uncover sensitive information during online voting.<n>Our analysis reveals that, even without accessing the content, it is possible to infer critical voter actions, such as whether a person votes, the exact moment a ballot is submitted, and whether the ballot is valid or spoiled.<n>We evaluate our attacks on two widely used online voting platforms, one proprietary and one partially open source, achieving classification accuracy as high as 99.5%.
arXiv Detail & Related papers (2025-09-19T07:14:01Z) - SmartphoneDemocracy: Privacy-Preserving E-Voting on Decentralized Infrastructure using Novel European Identity [0.0]
SmartphoneDemocracy is a novel e-voting protocol that combines three key technologies.<n>Our protocol enables voters to register and cast ballots anonymously and verifiably directly from their smartphones.
arXiv Detail & Related papers (2025-07-13T02:39:10Z) - The Decisive Power of Indecision: Low-Variance Risk-Limiting Audits and Election Contestation via Marginal Mark Recording [51.82772358241505]
Risk-limiting audits (RLAs) are techniques for verifying the outcomes of large elections.
We define new families of audits that improve efficiency and offer advances in statistical power.
New audits are enabled by revisiting the standard notion of a cast-vote record so that it can declare multiple possible mark interpretations.
arXiv Detail & Related papers (2024-02-09T16:23:54Z) - Disentangle Before Anonymize: A Two-stage Framework for Attribute-preserved and Occlusion-robust De-identification [55.741525129613535]
"Disentangle Before Anonymize" is a novel two-stage Framework(DBAF)<n>This framework includes a Contrastive Identity Disentanglement (CID) module and a Key-authorized Reversible Identity Anonymization (KRIA) module.<n>Extensive experiments demonstrate that our method outperforms state-of-the-art de-identification approaches.
arXiv Detail & Related papers (2023-11-15T08:59:02Z) - RiDDLE: Reversible and Diversified De-identification with Latent
Encryptor [57.66174700276893]
This work presents RiDDLE, short for Reversible and Diversified De-identification with Latent Encryptor.
Built upon a pre-learned StyleGAN2 generator, RiDDLE manages to encrypt and decrypt the facial identity within the latent space.
arXiv Detail & Related papers (2023-03-09T11:03:52Z) - Unsupervised Text Deidentification [101.2219634341714]
We propose an unsupervised deidentification method that masks words that leak personally-identifying information.
Motivated by K-anonymity based privacy, we generate redactions that ensure a minimum reidentification rank.
arXiv Detail & Related papers (2022-10-20T18:54:39Z) - TRIP: Coercion-resistant Registration for E-Voting with Verifiability and Usability in Votegral [4.589345192613584]
Votegral is a coercion-resistant voting architecture that leverages the physical security of in-person registration to address credential-issuance challenges.<n>The voter learns and can verify in the privacy booth which credential is real, but real and fake credentials thereafter appear indistinguishable to others.<n>Results with our prototype suggest that Votegral is practical and sufficiently scalable for real-world elections.
arXiv Detail & Related papers (2022-02-14T13:35:46Z) - OpenVoting: Recoverability from Failures in Dual Voting [0.3903025330856987]
We consider the setting of emphdual voting protocols, where the cryptographic guarantees of end-to-end verifiable voting are combined with the simplicity of audit using voter-verified paper records (VVPR)
We first consider the design requirements of such a system and then suggest a protocol called emphOpenVoting, which identifies a verifiable subset of error-free votes consistent with the VVPRs, and the polling booths corresponding to the votes that fail to verify with possible reasons for the failures.
arXiv Detail & Related papers (2019-08-26T09:32:54Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.