Helger Lipmaa's publications

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. Journal of Computer Security, 21 (5):685--719, November 2013.

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

Abstract:

We propose a new non-interactive (perfect) zero-knowledge (NIZK) shuffle argument that, when compared \changedx{with} 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. This can be interpreted as a general technique of decreasing the offline cost of an arbitrary shuffle argument.

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


More information: Publisher Webpage.


Authors:

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