Non-interactive delegation and batch NP verification from standard computational assumptions

    STOC, pp. 474-482, 2017.

    Cited by: 18|Bibtex|Views2|Links
    EI

    Abstract:

    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

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments