A Commitment-Consistent Proof of a Shuffle

DOI10.1007/978-3-642-02620-1_28zbMath1284.94125OpenAlexW2123715895MaRDI QIDQ3634509

Douglas Wikström

Publication date: 25 June 2009

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02620-1_28

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

More efficient shuffle argument from unique factorization ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Mix-nets from re-randomizable and replayable CCA-secure public-key encryption ⋮ Traceable receipt-free encryption ⋮ Improving the Performance of Cryptographic Voting Protocols ⋮ Lattice-Based Proof of a Shuffle ⋮ Universally composable \(\varSigma \)-protocols in the global random-oracle model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Receipt-free secret-ballot elections (extended abstract)
• An Implementation of a Universally Verifiable Electronic Voting Scheme Based on Shuffling
• How to Shuffle in Public
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Offline/Online Mixing
• A Sender Verifiable Mix-Net and a New Proof of a Shuffle
• Selected Areas in Cryptography
• Theory of Cryptography

This page was built for publication: A Commitment-Consistent Proof of a Shuffle