The following publications are possibly variants of this publication:
- An Efficient Pairing-Based Shuffle ArgumentPrastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac 0001. iacr, 2017:894, 2017. [doi]
- More Efficient Shuffle Argument from Unique FactorizationToomas Krips, Helger Lipmaa. ctrsa 2021: 252-275 [doi]
- More Efficient Shuffle Argument from Unique FactorizationToomas Krips, Helger Lipmaa. iacr, 2021:438, 2021. [doi]
- Efficient Culpably Sound NIZK Shuffle Argument Without Random OraclesPrastudy Fauzi, Helger Lipmaa. ctrsa 2016: 200-216 [doi]
- A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle ArgumentHelger Lipmaa, Bingsheng Zhang. scn 2012: 477-502 [doi]
- Efficient Culpably Sound NIZK Shuffle Argument without Random OraclesPrastudy Fauzi, Helger Lipmaa. iacr, 2015:1112, 2015. [doi]
- A more efficient computationally sound non-interactive zero-knowledge shuffle argumentHelger Lipmaa, Bingsheng Zhang. jcs, 21(5):685-719, 2013. [doi]
- A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle ArgumentHelger Lipmaa, Bingsheng Zhang. iacr, 2011:394, 2011. [doi]
- A Shuffle Argument Secure in the Generic ModelPrastudy Fauzi, Helger Lipmaa, Michal Zajac. asiacrypt 2016: 841-872 [doi]