Abstract
Under a computational assumption, and assuming that both Prover and Verifier are computationally bounded, we show a one-round (i.e., Verifier speaks and then Prover answers) witness-indistinguishable interactive proof for NP with poly-logarithmic communication complexity. A major application of our main result is that we show how to check in an efficient manner and without any additional interaction the correctness of the output of any remote procedure call.
Cite
CITATION STYLE
Aiello, W., Bhatt, S., Ostrovsky, R., & Raj Rajagopalan, S. (2000). Fast verification of any remote procedure call: Short witness-indistinguishable one-round proofs for NP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 463–474). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
