Simple and Efficient Shuffling with Provable Correctness and ZK Privacy

DOI10.1007/11535218_12zbMATH Open1145.94449OpenAlexW1482231432MaRDI QIDQ5451026FDOQ5451026

Authors: Kun Peng, Ed Dawson, Colin A. Boyd 

Publication date: 17 March 2008

Published in: Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11535218_12

Recommendations

• scientific article; zbMATH DE number 1842502
• A verifiable secret shuffle of homomorphic encryptions
• Verifiable Shuffle of Large Size Ciphertexts
• A Verifiable Secret Shuffe of Homomorphic Encryptions
• Secure Multi-party Shuffling

zbMATH Keywords

permutationzero knowledgeprivacycorrectnessShuffling

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (10)

• Correction, Optimisation and Secure and Efficient Application of PBD Shuffling
• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• An Efficient Aggregate Shuffle Argument Scheme
• Prêt à voter with Paillier encryption
• Formal and precise analysis of soundness of several shuffling schemes
• Distributed shuffling in adversarial environments
• Public Key Cryptography – PKC 2004
• Efficiently shuffling in public
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting

This page was built for publication: Simple and Efficient Shuffling with Provable Correctness and ZK Privacy

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