Abstract
In this paper we use strong one-time signatures schemes and adaptive Non-Interactive Zero-Knowledge (NIZK) proof systems to construct an efficient unbounded simulation-sound NIZK proof system, assuming the existence of one-way permutation and pseudorandom generator. Furthermore, we can obtain an unbounded non-malleable NIZK proof system when replacing the adaptive NIZK proof systems in our construction with adaptive NIZK proof of knowledge. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Li, H., & Li, B. (2005). An unbounded simulation-sound non-interactive zero-knowledge proof system for NP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3822 LNCS, pp. 210–220). Springer Verlag. https://doi.org/10.1007/11599548_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
