Audit-or-Cast: Enforcing Honest Elections with Privacy-Preserving Public Verification

• URL: http://arxiv.org/abs/2604.18163v2
• Date: Tue, 21 Apr 2026 17:02:34 GMT
• Title: Audit-or-Cast: Enforcing Honest Elections with Privacy-Preserving Public Verification
• Abstract summary: We present ACE, a voting protocol that reconciles public auditability with strong privacy guarantees.<n>We show that it simultaneously achieves end-to-end verifiability, publicly tally-hiding results, and strong receipt-freeness without trusted clients.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Electronic voting systems must balance public verifiability with voter privacy and coercion resistance. Existing cryptographic protocols typically achieve end-to-end verifiability by revealing vote distributions, relying on trusted clients, or enabling transferable receipts - design choices that often compromise trust or privacy in real-world deployments. We present ACE, a voting protocol that reconciles public auditability with strong privacy guarantees. The protocol combines a publicly verifiable, tally-hiding aggregation mechanism with an Audit-or-Cast challenge that enforces cast-as-intended even under untrusted client assumptions. Tallier-side re-randomization eliminates persistent links between voters and public records, yielding information-theoretic receipt-freeness assuming at least one honest tallier. We formalize the security of ACE and show that it simultaneously achieves end-to-end verifiability, publicly tally-hiding results, and strong receipt-freeness without trusted clients.

Related papers

• Publicly Understandable Electronic Voting: A Non-Cryptographic, End-to-End Verifiable Scheme [0.0]
  Software-Free Verification (SFV) is a standard requiring that voters can independently verify election integrity without relying on any software.<n>We propose a practical, non-cryptographic in-booth voting scheme that achieves SFV for national-scale elections.
  arXiv  Detail & Related papers  (2026-03-23T11:19:15Z)
• Poster: Privacy-Preserving Compliance Checks on Ethereum via Selective Disclosure [9.47737368469032]
  This work proposes a general Selective Disclosure Framework built on, designed to decouple attribute verification from identity revelation.<n>By utilizing client-side zk-SNARKs, the framework enables users to prove specific eligibility predicates without revealing underlying identity documents.<n>Preliminary results indicate that strict compliance requirements can be satisfied with negligible client-side latency.
  arXiv  Detail & Related papers  (2026-02-20T14:54:22Z)
• Preventing the Collapse of Peer Review Requires Verification-First AI [49.995126139461085]
  We propose truth-coupling, i.e. how tightly venue scores track latent scientific truth.<n>We formalize two forces that drive a phase transition toward proxy-sovereign evaluation.
  arXiv  Detail & Related papers  (2026-01-23T17:17:32Z)
• Your Privacy Depends on Others: Collusion Vulnerabilities in Individual Differential Privacy [50.66105844449181]
  Individual Differential Privacy (iDP) promises users control over their privacy, but this promise can be broken in practice.<n>We reveal a previously overlooked vulnerability in sampling-based iDP mechanisms.<n>We propose $(varepsilon_i,_i,overline)$-iDP a privacy contract that uses $$-divergences to provide users with a hard upper bound on their excess vulnerability.
  arXiv  Detail & Related papers  (2026-01-19T10:26:12Z)
• VeilAudit: Breaking the Deadlock Between Privacy and Accountability Across Blockchains [2.676349883103404]
  Cross chain interoperability in blockchain systems exposes a fundamental tension between user privacy and regulatory accountability.<n>We present VeilAudit, a cross chain auditing framework that introduces Auditor Only Linkability.<n>VeilAudit achieves this with a user generated Linkable Audit Tag that embeds a zero knowledge proof to attest to its validity without exposing the user master wallet address.
  arXiv  Detail & Related papers  (2025-10-14T05:16:23Z)
• 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)
• Confidential Guardian: Cryptographically Prohibiting the Abuse of Model Abstention [65.47632669243657]
  A dishonest institution can exploit mechanisms to discriminate or unjustly deny services under the guise of uncertainty.<n>We demonstrate the practicality of this threat by introducing an uncertainty-inducing attack called Mirage.<n>We propose Confidential Guardian, a framework that analyzes calibration metrics on a reference dataset to detect artificially suppressed confidence.
  arXiv  Detail & Related papers  (2025-05-29T19:47:50Z)
• SD-BLS: Privacy Preserving Selective Disclosure of Verifiable Credentials with Unlinkable Threshold Revocation [0.0]
  We propose a method for selective disclosure and privacy-preserving revocation of digital credentials. We use second-order Elliptic Curves and Boneh-Lynn-Shacham (BLS) signatures. Our system's unique design enables extremely fast revocation checks, even with large revocation lists.
  arXiv  Detail & Related papers  (2024-06-27T09:41:13Z)
• Secure Aggregation is Not Private Against Membership Inference Attacks [66.59892736942953]
  We investigate the privacy implications of SecAgg in federated learning. We show that SecAgg offers weak privacy against membership inference attacks even in a single training round. Our findings underscore the imperative for additional privacy-enhancing mechanisms, such as noise injection.
  arXiv  Detail & Related papers  (2024-03-26T15:07:58Z)
• 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)
• FedGT: Identification of Malicious Clients in Federated Learning with Secure Aggregation [69.75513501757628]
  FedGT is a novel framework for identifying malicious clients in federated learning with secure aggregation. We show that FedGT significantly outperforms the private robust aggregation approach based on the geometric median recently proposed by Pillutla et al.
  arXiv  Detail & Related papers  (2023-05-09T14:54:59Z)
• A Randomized Approach for Tight Privacy Accounting [63.67296945525791]
  We propose a new differential privacy paradigm called estimate-verify-release (EVR) EVR paradigm first estimates the privacy parameter of a mechanism, then verifies whether it meets this guarantee, and finally releases the query output. Our empirical evaluation shows the newly proposed EVR paradigm improves the utility-privacy tradeoff for privacy-preserving machine learning.
  arXiv  Detail & Related papers  (2023-04-17T00:38:01Z)

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.