Shuffle arguments based on subset-checking

DOI10.1007/978-3-031-71070-4_16MaRDI QIDQ6660397zbMATH OpenFDO

Authors Behzad Abdolmaleki, Prastudy Fauzi, Toomas Krips, Janno Siim

Publication date 10 January 2025

Full work available at URL https://doi.org/10.1007/978-3-031-71070-4_16

zbMATH Keywords

electronic votingshuffle argumentzero-knowledge

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Verifiable Shuffle of Large Size Ciphertexts
• A non-interactive shuffle argument with low trust assumptions
• A verifiable secret shuffle of homomorphic encryptions

Cites work

• A compressed \(\varSigma \)-protocol theory for lattices
• A non-interactive shuffle argument with low trust assumptions
• An efficient pairing-based shuffle argument
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• scientific article; zbMATH DE number 1024065 (Why is no real title available?)
• scientific article; zbMATH DE number 1842502 (Why is no real title available?)
• Lattice-based proof of shuffle and applications to electronic voting
• On publicly-accountable zero-knowledge and small shuffle arguments
• On the Evaluation of Powers and Monomials
• Quisquis: a new design for anonymous cryptocurrencies
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Trapdoors for hard lattices and new cryptographic constructions

This page was built for publication: Shuffle arguments based on subset-checking

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