Abstract
We introduce the notion of robust transformations of interactive proof systems. A robust transformation takes an interactive proof system (P, V), and produces a new interactive proof system, (P*, V*), such that the power of P* is within a polynomial factor of that of P. We show that, given an ideal protocol for secure circuit evaluation, there exists a robust transformation that converts interactive proof systems to zeroknowledge interactive proof systems.
Cite
CITATION STYLE
Kilian, J. (1991). Achieving zero-knowledge robustly. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 537 LNCS, pp. 313–325). Springer Verlag. https://doi.org/10.1007/3-540-38424-3_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
