scientific article; zbMATH DE number 1303140

MaRDI QIDQ4249656zbMATH OpenFDO

Authors Masayuki Abe

Publication date 17 June 1999

zbMATH Keywords

electronic votingmix-netuniversal verifiability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• An Efficient Publicly Verifiable Mix-Net for Long Inputs
• How to break a practical MIX and design a new one
• Theory of Cryptography
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle

Cited in

(14)

• On publicly-accountable zero-knowledge and small shuffle arguments
• Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• Distributed Verification of Mixing - Local Forking Proofs Model
• An Efficient Publicly Verifiable Mix-Net for Long Inputs
• scientific article; zbMATH DE number 1504554 (Why is no real title available?)
• Verifiable elections that scale for free
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Electronic jury voting protocols
• A verifiable secret shuffle of homomorphic encryptions
• Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
• Lattice-Based Proof of a Shuffle
• A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing
• Privacy preserving electronic data gathering

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249656)