This paper proves that winner determination under Stable Voting and Simple Stable Voting is PSPACE-complete.

The paper proves that any voting rule based solely on wallet balance, including anti-plutocratic mechanisms like Quadratic Voting, is fundamentally vulnerable to Sybil attacks on permissionless blockc…

The paper demonstrates that the Brazilian e-Voting Machine interface generates a simple and highly distinctive electromagnetic spectral signature, raising significant concerns about its susceptibility…

This paper improves an algorithm for computing lower bounds on the margin of a Single Transferable Vote (STV) election, making risk-limiting audits more practical.

This paper analyzes the Loki e-voting protocol, demonstrating that while it attempts to solve coercion-resistance without pre-agreed secrets, it remains vulnerable to specific attacks, suggesting that…

The paper proposes a non-cryptographic, End-to-End Verifiable (E2E-V) voting scheme that achieves Software-Free Verification (SFV) by allowing voters to audit election integrity using only basic arith…

The paper introduces two novel risk-limiting audit techniques—statistical manifest generation and direct ballot selection—that significantly reduce the computational complexity and time required for p…

The paper introduces ACE, a novel voting protocol that achieves end-to-end verifiability and strong voter privacy by combining tally-hiding aggregation with an Audit-or-Cast challenge, eliminating the…

This paper proposes a secure liquid democracy mechanism using sealed delegation and ranked multi-delegation with personal fallback ballots, and evaluates its impact on representational accuracy and vo…

This paper proposes a method for auditing parliamentary elections to certify a winning majority instead of individual seats, reducing the number of ballots inspected by almost a thousand-fold.

The paper proves that the reversible elementary second order cellular automaton rule 115 is periodic when started on finite initial configurations.

This paper introduces Democratic ICAI, an approach to summarize preferences into natural-language principles through structured persona debate, yielding clearer and more comprehensive steering princip…

This paper presents new polynomial-time algorithms for determining the winner of the unbiased triangle game on the edge set of general graphs using the edge-triangle incidence graph.

This paper presents an architecture for private and verifiable electronic voting using the Paillier cryptosystem, without a trusted key dealer, and proves its correctness under certain assumptions.

The paper proposes a secure, verifiable, and privacy-preserving e-collecting protocol tailored for the Swiss political system, guaranteeing participation privacy even without assuming an anonymous com…

The paper proposes a method using on-chain voting analysis to detect emerging partisan communities within DAOs, demonstrating that addresses destined to fork cluster together months before actual orga…

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

This paper studies the decidability and complexity properties of unary three-way and two-way deterministic and nondeterministic two-dimensional automata.

This paper provides the first longitudinal analysis of log-based detection rule evolution in public repositories, finding that rule changes reflect ongoing operational trade-offs rather than steady co…