More efficient shuffle argument from unique factorization

DOI10.1007/978-3-030-75539-3_11zbMath1479.94201OpenAlexW3159203640MaRDI QIDQ826262

Helger Lipmaa, Toomas Krips

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

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

Uses Software

• Verificatum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A verifiable secret shuffle of homomorphic encryptions
• An efficient pairing-based shuffle argument
• Quisquis: a new design for anonymous cryptocurrencies
• Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles
• Efficient Zero-Knowledge Argument for Correctness of a Shuffle
• 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 Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Proofs of Restricted Shuffles
• A Commitment-Consistent Proof of a Shuffle
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• The knowledge complexity of interactive proof-systems
• A Mix-Net from Any CCA2 Secure Cryptosystem
• A Non-interactive Shuffle with Pairing Based Verifiability
• Verificatum