scientific article; zbMATH DE number 1842502

zbMath1003.94522MaRDI QIDQ4783736

Kazue Sako, Jun Furukawa

Publication date: 8 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390368

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

permutationelectronic votingmix-netuniversal verifiability

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (16)

More efficient shuffle argument from unique factorization ⋮ Structure-preserving signatures and commitments to group elements ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Electronic jury voting protocols ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ Lattice-Based Proof of a Shuffle ⋮ Privacy Preserving Data Mining within Anonymous Credential Systems ⋮ Simplified Submission of Inputs to Protocols ⋮ Formal and Precise Analysis of Soundness of Several Shuffling Schemes ⋮ A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ A Commitment-Consistent Proof of a Shuffle ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security

This page was built for publication: