Loading...
PRIVATE.ME Docs
Explore ACIs
PRIVATE.ME PLATFORM

xVote: Electronic Voting Ballot Secrecy

XorIDA splits each ballot across multiple independent election authorities. Tallying requires threshold cooperation. No single authority can reveal individual votes.

Governance / Elections COMING SOON XorIDA Powered
Section 01

The Problem

Electronic voting systems require trust in election authorities to maintain ballot secrecy. No cryptographic guarantee currently prevents individual vote exposure by a compromised authority.

Traditional e-voting systems store complete ballots on centralized servers. Election administrators, database operators, and system vendors all have theoretical access to individual voting records. Even with encryption, the decryption key typically resides with a single entity or small trusted group.

Paper ballots offer physical anonymity but cannot scale. Digital systems offer scalability but sacrifice the mathematical guarantee of secrecy. The challenge is preserving ballot secrecy with a cryptographic guarantee while enabling accurate, auditable tallying.

The Old Way

CENTRAL SERVER All Ballots Voter Identities Decryption Key INSIDER VOTES EXPOSED
Section 02

The PRIVATE.ME Solution

XorIDA splits each ballot into N shares distributed across independent election authorities. Tallying requires K-of-N cooperation. Individual vote secrecy is information-theoretically guaranteed.

Each ballot is split at the voter's device before leaving the client. No complete ballot ever traverses the network or exists on any server. Election authorities receive shares that individually reveal zero information about the voter's choices.

Built-in duplicate vote detection uses deterministic voter identifiers (derived from registration credentials) to prevent double-voting without linking votes to identities. The tally phase reconstructs ballots only in aggregate, never individually.

The New Way

BALLOT Client-side XorIDA Split K-of-N Authority A HMAC verified Authority B HMAC verified Authority C HMAC verified TALLY 2-of-3
Section 03

How It Works

The ballot secrecy pipeline ensures that no complete ballot ever leaves the voter's device. Tallying is performed through threshold reconstruction with cryptographic audit trails.

Vote Client device Dedup Check Voter hash XorIDA Split K-of-N shares Distribute N authorities Auth 1 Auth 2 Auth N
Key Security Properties
Ballot secrecy: Information-theoretically impossible for any single authority to determine a voter's choices. Duplicate prevention: Deterministic voter identifiers detect double-voting without linking to ballot content. Audit trail: Every share submission is logged with cryptographic receipt, enabling end-to-end verifiability.
Section 04

Use Cases

🏛
Government
National Elections

Split ballots across independent election commissions. Threshold tallying prevents any single commission from accessing individual votes. Cryptographic receipts for voter verification.

3-of-5 threshold
📈
Corporate
Shareholder Voting

Board resolutions and proxy votes split across independent registrars. Ensures vote confidentiality while maintaining SEC compliance and audit requirements.

2-of-3 threshold
🏭
Labor
Union Elections

Union leadership elections with cryptographic ballot secrecy. Prevents retaliation by ensuring no individual vote can be traced. NLRB-compatible audit trail.

2-of-3 threshold
🎓
Academia
Academic Governance

Faculty senate votes, tenure decisions, and curriculum approvals with guaranteed ballot secrecy. Eliminates political pressure on individual voting decisions.

2-of-3 threshold
Section 05

Integration

Quick Start
import { castBallot, tallyVotes } from '@private.me/ballotsplit';

// Cast a ballot split across 3 authorities (2 needed)
const receipt = await castBallot(ballot, authorities, {
  n: 3,
  k: 2,
});

// Voter receives cryptographic receipt
console.log(receipt.verificationCode);

// Tally with threshold cooperation
const results = await tallyVotes({
  authorities: [authorities[0], authorities[2]],
  electionId: '2026-board-vote',
});
castBallot(ballot: Ballot, authorities: string[], config: { n: number, k: number }): Promise<BallotReceipt>
Splits a ballot into N shares and distributes to independent election authorities. Returns a cryptographic receipt for voter verification. Includes duplicate vote detection.
tallyVotes(opts: { authorities: string[], electionId: string }): Promise<TallyResult>
Collects K shares from cooperating authorities and produces aggregate tallies. Individual ballots are never reconstructed. Results include cryptographic proof of correctness.
Section 06

Security Properties

PropertyMechanismGuarantee
Ballot SecrecyXorIDA GF(2) splittingInformation-theoretic (unconditional)
IntegrityHMAC-SHA256 per shareTamper detection on every share
Duplicate PreventionDeterministic voter hashDouble-voting detected instantly
VerifiabilityCryptographic receiptsEnd-to-end audit trail
Coercion ResistanceNo reconstructible individual ballotsCannot prove how you voted
<1ms
Ballot split time
0
Dependencies
100%
Test coverage
K-of-N
Authority threshold
VERIFIED BY XPROVE

Cryptographic Proof of Correctness

This ACI's computations can be cryptographically verified by xProve — so regulators, auditors, and counterparties can confirm results without re-running the computation or accessing the underlying data.

XPROVE INTEGRATION
Tier 1: HMAC audit trail — always on, ~1.3x overhead.
Tier 2: Commit-and-reveal — anti-equivocation for Beaver triples.
Tier 3: IT-MACs — malicious-security detection between parties.
Tier 4: KKW zero-knowledge proofs — publicly verifiable, ~50 KB, post-quantum.

Read the xProve white paper →
GET STARTED

Ready to deploy xVote?

Talk to Ren, our AI sales engineer, or book a live demo with our team.

Book a Demo

© 2026 StandardClouds Inc. dba PRIVATE.ME. All rights reserved.

VERIFIABLE WITHOUT CODE EXPOSURE

Ship Proofs, Not Source

xVote generates cryptographic proofs of correct execution without exposing proprietary algorithms. Verify integrity using zero-knowledge proofs — no source code required.

XPROVE CRYPTOGRAPHIC PROOF
Download proofs:

Verify proofs online →

Use Cases

🏛️
REGULATORY
FDA / SEC Submissions
Prove algorithm correctness for distributed systems without exposing trade secrets or IP.
Zero IP Exposure
🏦
FINANCIAL
Audit Without Access
External auditors verify secure operations without accessing source code or production systems.
FINRA / SOX Compliant
🛡️
DEFENSE
Classified Verification
Security clearance holders verify distributed systems correctness without clearance for source code.
CMMC / NIST Ready
🏢
ENTERPRISE
Procurement Due Diligence
Prove security + correctness during RFP evaluation without NDA or code escrow.
No NDA Required