Probabilistically Checkable Arguments
CRYPTO, pp. 143-159, 2009.
probabilistically checkable argumentpir schemegeneral reductionsoundness propertyexponential timeMore(7+)
We give a general reduction that converts any public-coin interactive proof into a one-round (two-message) argument. The reduction relies on a method proposed by Aiello et al. , of using a Private-Information-Retrieval (PIR) scheme to collapse rounds in interactive protocols. For example, the reduction implies that for any security par...More