More efficient shuffle argument from unique factorization

DOI10.1007/978-3-030-75539-3_11MaRDI QIDQ826262zbMATH OpenOpenAlexFDO

Authors Toomas Krips, Helger Lipmaa

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-75539-3_11

zbMATH Keywords

unique factorizationmix-netshuffle argument

Mathematics Subject Classification ID

Cryptography (94A60) Voting theory (91B12) Network protocols (68M12)

Recommendations

• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Efficient culpably sound NIZK shuffle argument without random oracles
• An efficient pairing-based shuffle argument
• Verifiable Shuffle of Large Size Ciphertexts
• An Efficient Aggregate Shuffle Argument Scheme

Cites work

• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3689291 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• scientific article; zbMATH DE number 1107669 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 1842491 (Why is no real title available?)
• scientific article; zbMATH DE number 1842502 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• A Commitment-Consistent Proof of a Shuffle
• A Non-interactive Shuffle with Pairing Based Verifiability
• A mix-net from any CCA2 secure cryptosystem
• A more efficient computationally sound non-interactive zero-knowledge shuffle argument
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A shuffle argument secure in the generic model
• A verifiable secret shuffle of homomorphic encryptions
• An efficient pairing-based shuffle argument
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• Efficient culpably sound NIZK shuffle argument without random oracles
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• One-out-of-many proofs: or how to leak a secret and spend a coin
• Proofs of Restricted Shuffles
• Quisquis: a new design for anonymous cryptocurrencies
• The knowledge complexity of interactive proof-systems
• Verificatum

Cited in

(3)

• New Techniques for Non-interactive Shuffle and Range Arguments
• Shuffle factorization is unique
• An efficient pairing-based shuffle argument

Describes a project that uses

Uses Software

• Verificatum

This page was built for publication: More efficient shuffle argument from unique factorization

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