Publicly Understandable Electronic Voting: A Non-Cryptographic, End-to-End Verifiable Scheme
Publicly Understandable Electronic Voting: A Non-Cryptographic, End-to-End Verifiable Scheme explores A non-cryptographic voting system allowing voters to verify election integrity using only basic arithmetic and physical receipts, restoring public trust in democratic processes.. Commercial viability score: 3/10 in E-Voting Security.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $10K - $14K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Builds On ThisOn the Necessity of Pre-agreed Secrets for Thwarting Last-minute Coercion: Vulnerabilities and Lessons From the Loki E-voting ProtocolViability: 0.0
- Prior WorkSilent Guardians: Independent and Secure Decision Tree Evaluation Without ChatterViability: 3.0
- Prior WorkEpistemic Filtering and Collective Hallucination: A Jury Theorem for Confidence-Calibrated AgentsViability: 3.0
- Prior WorkMitigating Collusion in Proofs of LiabilitiesViability: 3.0
- Higher ViabilityRepurposing Backdoors for Good: Ephemeral Intrinsic Proofs for Verifiable Aggregation in Cross-silo Federated Learning