Possibly Related Publications

The following publications are possibly variants of this publication:

• A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle ArgumentHelger Lipmaa, Bingsheng Zhang. iacr, 2011:394, 2011. [doi]
• A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle ArgumentHelger Lipmaa, Bingsheng Zhang. scn 2012: 477-502 [doi]
• More Efficient Shuffle Argument from Unique FactorizationToomas Krips, Helger Lipmaa. iacr, 2021:438, 2021. [doi]
• More Efficient Shuffle Argument from Unique FactorizationToomas Krips, Helger Lipmaa. ctrsa 2021: 252-275 [doi]
• Efficient Non-Interactive Zero Knowledge Arguments for Set OperationsPrastudy Fauzi, Helger Lipmaa, Bingsheng Zhang. iacr, 2014:6, 2014. [doi]
• Efficient Non-Interactive Zero Knowledge Arguments for Set OperationsPrastudy Fauzi, Helger Lipmaa, Bingsheng Zhang. fc 2014: 216-233 [doi]
• Efficient Culpably Sound NIZK Shuffle Argument without Random OraclesPrastudy Fauzi, Helger Lipmaa. iacr, 2015:1112, 2015. [doi]
• Efficient Culpably Sound NIZK Shuffle Argument Without Random OraclesPrastudy Fauzi, Helger Lipmaa. ctrsa 2016: 200-216 [doi]