Non-interactive delegation and batch NP verification from standard computational assumptions
STOC, pp. 474-482, 2017.
We present an adaptive and non-interactive protocol for verifying arbitrary efficient computations in fixed polynomial time. Our protocol is computationally sound and can be based on any computational PIR scheme, which in turn can be based on standard polynomial-time cryptographic assumptions (e.g. the worst case hardness of polynomial-fa...More
Full Text (Upload PDF)