scientific article
From MaRDI portal
Publication:2757263
zbMath0973.94525MaRDI QIDQ2757263
Publication date: 25 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Electronic jury voting protocols ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Privacy and verifiability in voting systems: methods, developments and trends ⋮ Information-Theoretic Security Without an Honest Majority ⋮ Explainable arguments ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ Traceable receipt-free encryption ⋮ Lattice-Based Proof of a Shuffle ⋮ Cryptanalysis on Mu-Varadharajan's e-voting schemes ⋮ Secret, verifiable auctions from elections ⋮ Ceremonies for End-to-End Verifiable Elections ⋮ New receipt-free voting scheme using double-trapdoor commitment ⋮ Anonymous message communications with user hierarchy in a multicast system ⋮ Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol ⋮ Computer science and decision theory ⋮ A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting ⋮ Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems ⋮ \(k\)-anonymous data collection ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ Non-interactive anonymous router ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ How to Challenge and Cast Your e-Vote ⋮ Relations between privacy, verifiability, accountability and coercion-resistance in voting protocols ⋮ A new post-quantum voting protocol based on physical laws
