Abstract
We show that any language L in NP has a non-interactive zero-knowledge proof system which uses Θ(log(1/s) + nε) random bits, where s is the soundness error, n the length of the input and can be any constant > 0. In order to achieve this result, we formulate and investigate the problem of randomness-eficient error reduction for non-interactive zero-knowledge proofs, which generalizes the analogue and well-studied problem for BPP computation. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
De Santis, A., Di Crescenzo, G., & Persiano, G. (1999). Non-interactive zero-knowledge: A low-randomness characterization of np (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1644 LNCS, pp. 271–280). Springer Verlag. https://doi.org/10.1007/3-540-48523-6_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
