106 search results - page 3 / 22 » Probabilistically Checkable Arguments |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
STACS
2001
Springer
15 years 2 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
COCO
2005
Springer
15 years 3 months ago
2005
Springer
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
88
Voted
ASIACRYPT
2010
Springer
14 years 8 months ago
2010
Springer
We show that probabilistically checkable proofs can be used to shorten non-interactive zero-knowledge proofs. We obtain publicly verifiable non-interactive zero-knowledge proofs fo...
115
click to vote
COMMA
2010
14 years 5 months ago
2010
Abstract. We propose an argumentation framework for modelling jury-based dispute resolution where the dispute parties present their arguments before a judge and a jury. While the j...