scientific article; zbMATH DE number 1303140

zbMATH Open0929.68062MaRDI QIDQ4249656FDOQ4249656

Authors: Masayuki Abe 

Publication date: 17 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

electronic votingmix-netuniversal verifiability

Mathematics Subject Classification ID

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

Cited In (14)

• Lattice-Based Proof of a Shuffle
• Title not available (Why is that?)
• Electronic jury voting protocols
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Improving the efficiency of re-randomizable and replayable CCA secure public key encryption
• Distributed Verification of Mixing - Local Forking Proofs Model
• A verifiable secret shuffle of homomorphic encryptions
• An Efficient Publicly Verifiable Mix-Net for Long Inputs
• Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
• Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
• On publicly-accountable zero-knowledge and small shuffle arguments
• A Verifiable and Practical Lattice-Based Decryption Mix Net with External Auditing
• Verifiable Elections That Scale for Free
• 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)