More efficient shuffle argument from unique factorization

DOI10.1007/978-3-030-75539-3_11zbMATH Open1479.94201OpenAlexW3159203640MaRDI QIDQ826262FDOQ826262

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

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

zbMATH Keywords

unique factorizationmix-netshuffle argument

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)