This paper studies a dynamic assortment problem on a two-sided service platform with incomplete information and heterogeneous customers, and develops a data-driven algorithm to learn parameters and op…

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…

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…

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…

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.

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…

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.

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…

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

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…

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 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 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 analyzes 48 large, active DAOs on Ethereum and finds that common governance mechanisms like token registration, staking, and delegation systematically reinforce the centralization of voting…

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.

This survey reviews hardware-rooted trust mechanisms, such as PUFs and TPMs, demonstrating that hardware-based solutions are superior to software-only methods for ensuring secure authentication and AI…

This paper introduces the Machine Identity Governance Taxonomy (MIGT), a comprehensive framework designed to govern the rapidly expanding and currently ungoverned machine identities used by AI systems…

The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…

The paper proposes a TEE-based architecture that enables external, auditable verification of AI-assisted grant evaluations without exposing the proprietary model, scoring logic, or intermediate reason…

The paper introduces CyberJurors, a multi-agent framework and the VerdictBench benchmark to simulate and solve complex e-commerce dispute verdicts by modeling the reasoning and consensus process of cr…