TY - GEN
T1 - Fast verification of any remote procedure call
T2 - 27th International Colloquium on Automata, Languages and Programming, ICALP 2000
AU - Aiello, William
AU - Bhatt, Sandeep
AU - Ostrovsky, Rafail
AU - Raj Rajagopalan, S.
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.
PY - 2000
Y1 - 2000
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84974573487&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84974573487&partnerID=8YFLogxK
U2 - 10.1007/3-540-45022-x_39
DO - 10.1007/3-540-45022-x_39
M3 - Conference contribution
AN - SCOPUS:84974573487
SN - 9783540450221
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 463
EP - 474
BT - Automata, Languages and Programming - 27th International Colloquium, ICALP 2000, Proceedings
A2 - Montanari, Ugo
A2 - Rolim, Jose D. P.
A2 - Welzl, Emo
Y2 - 9 July 2000 through 15 July 2000
ER -