Sciweavers

4 search results - page 1 / 1
» Perfect Non-interactive Zero Knowledge for NP
Sort
View
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
JOC
1998
76views more  JOC 1998»
13 years 4 months ago
Perfect Zero-Knowledge Arguments for NP Using Any One-Way Permutation
Moni Naor, Rafail Ostrovsky, Ramarathnam Venkatesa...
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
EUROCRYPT
2008
Springer
13 years 6 months ago
Isolated Proofs of Knowledge and Isolated Zero Knowledge
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These are proofs of knowledge where a cheating prover is allowed to exchange up to bits of communication wi...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...