A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument
From MaRDI portal
Publication:2912814
DOI10.1007/978-3-642-32928-9_27zbMath1351.94056OpenAlexW1545196615MaRDI QIDQ2912814
Bingsheng Zhang, Helger Lipmaa
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32928-9_27
Related Items (3)
More efficient shuffle argument from unique factorization ⋮ A Shuffle Argument Secure in the Generic Model ⋮ New Techniques for Non-interactive Shuffle and Range Arguments
This page was built for publication: A More Efficient Computationally Sound Non-Interactive Zero-Knowledge Shuffle Argument