A Sender Verifiable Mix-Net and a New Proof of a Shuffle

DOI10.1007/11593447_15zbMATH Open1154.94439OpenAlexW1498994266MaRDI QIDQ5451075FDOQ5451075

Authors: Douglas Wikström 

Publication date: 18 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11593447_15

Recommendations

• A verifiable secret shuffle of homomorphic encryptions
• A Non-interactive Shuffle with Pairing Based Verifiability
• Public Key Cryptography – PKC 2004
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• How to Shuffle in Public

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (12)

• Theory of Cryptography
• Crypto Santa
• Public Key Cryptography – PKC 2004
• Formal and precise analysis of soundness of several shuffling schemes
• Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
• Distributed Verification of Mixing - Local Forking Proofs Model
• Simplified Submission of Inputs to Protocols
• Mix-nets from re-randomizable and replayable CCA-secure public-key encryption
• An Adaptively Secure Mix-Net Without Erasures
• A Commitment-Consistent Proof of a Shuffle
• Securing Abe's mix-net against malicious verifiers via witness indistinguishability
• Efficient succinct zero-knowledge arguments in the CL framework

This page was built for publication: A Sender Verifiable Mix-Net and a New Proof of a Shuffle

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