Shuffle arguments based on subset-checking

DOI10.1007/978-3-031-71070-4_16MaRDI QIDQ6660397

Behzad Abdolmaleki, Janno Siim, Toomas Krips, Prastudy Fauzi

Publication date: 10 January 2025

zbMATH Keywords

zero-knowledgeelectronic votingshuffle argument

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A non-interactive shuffle argument with low trust assumptions
• Lattice-based proof of shuffle and applications to electronic voting
• An efficient pairing-based shuffle argument
• On publicly-accountable zero-knowledge and small shuffle arguments
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• A compressed \(\varSigma \)-protocol theory for lattices
• Structure-preserving and re-randomizable RCCA-secure public key encryption and its applications
• Quisquis: a new design for anonymous cryptocurrencies
• Trapdoors for hard lattices and new cryptographic constructions
• On the Evaluation of Powers and Monomials
• Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions

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)