Sciweavers

EUROCRYPT
2006
Springer
13 years 8 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai
STOC
1999
ACM
81views Algorithms» more  STOC 1999»
13 years 8 months ago
PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability
This paper strengthens the low-error PCP characterization of NP, coming closer to the upper limit of the BGLR conjecture. Consider the task of verifying a witness for the membersh...
Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, S...