An efficient pairing-based shuffle argument

DOI10.1007/978-3-319-70697-9_4zbMath1380.94088OpenAlexW2768583136MaRDI QIDQ1703916

Michał Zając, Janno Siim, Prastudy Fauzi, Helger Lipmaa

Publication date: 8 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70697-9_4

zbMATH Keywords

zero knowledgemix-netshuffle argumentcommon reference stringgeneric group model

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

More efficient shuffle argument from unique factorization ⋮ On QA-NIZK in the BPK Model ⋮ Another look at extraction and randomization of Groth's zk-SNARK ⋮ A Unified Framework for Non-universal SNARKs ⋮ Almost tightly-secure re-randomizable and replayable CCA-secure public key encryption ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Identity-based authenticated encryption with identity confidentiality

This page was built for publication: An efficient pairing-based shuffle argument