A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument

Helger Lipmaa and Bingsheng Zhang. A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument. In Ivan Visconti and Roberto De Prisco, editors, SCN 2012, volume 7485 of Lecture Notes in Computer Science, pages 477--502, Amalfi, Italy, September 5--7, 2012. Springer, Heidelberg.

File: [.pdf (334 KB)] pdf recommended.

Abstract:

We propose a new non-interactive (perfect) zero-knowledge (NIZK) shuffle argument that, when compared the only previously known efficient NIZK shuffle argument by Groth and Lu, has a small constant factor times smaller computation and communication, and is based on more standard computational assumptions. Differently from Groth and Lu who only prove the co-soundness of their argument under purely computational assumptions, we prove computational soundness under a necessary knowledge assumption. We also present a general transformation that results in a shuffle argument that has a quadratically smaller common reference string (CRS) and a small constant factor times times longer argument than the original shuffle.

Keywords: Bilinear pairings, cryptographic shuffle, non-interactive zero-knowledge, progression-free sets.

Comment: Full version is available at http://eprint.iacr.org/2011/394

• Helger Lipmaa
• Bingsheng Zhang

Page by Helger Lipmaa. Send your inqueries to <helger.lipmaa>">gmail.com.