Abstract. We propose a new random oracle-less NIZK shuffle argu- ment. It has a simple structure, where the first verification equation as-.
Nov 9, 2016 · We propose a new random oracle-less NIZK shuffle argument. It has a simple structure, where the first verification equation ascertains that ...
A new random oracle-less NIZK shuffle argument that has 3.5 times more efficient verification than the up-to-now most efficient shuffle argument by Fauzi ...
The new argument has 3.5 times more efficient verification than the up-to-now most efficient shuffle argument by Fauzi and Lipmaa CT-RSA 2016. Compared to the ...
A Shuffle Argument Secure in the Generic Model. Authors: P. Fauzi, H. Lipmaa and M. Zając. Status: Published. Publication type: Proceedings Refereed.
Duration: 27:50
Posted: Dec 25, 2016
Posted: Dec 25, 2016
We propose a new random oracle-less NIZK shuffle argument. It has a simple structure, where the first verification equation ascertains that the prover has ...
A Shuffle Argument Secure in the Generic Model. https://doi.org/10.1007/978-3-662-53890-6_28 · Full text. Journal: Advances in Cryptology – ASIACRYPT 2016 ...
We propose a new random oracle-less NIZK shuffle argument. It has a simple structure, where the first verification equation ascertains that the prover has ...
Welcome to the resource topic for 2016/866. Title: A Shuffle Argument Secure in the Generic Model. Authors: Prastudy Fauzi, Helger Lipmaa, Michał Zając.