An Efficient Pairing-Based Shuffle Argument.

We construct the most efficient known pairing-based NIZK shuffle argument. It consists of three subarguments that were carefully chosen to obtain optimal efficiency of the shuffle argument:1.A same-message argument based on the linear subspace QANIZK argument of Kiltz and Wee,2.A (simplified) permutation matrix argument of Fauzi, Lipmaa, and Zając,3.A (simplified) consistency argument of Groth and Lu.