152 search results - page 1 / 31 » Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use |
PROVSEC
2007
Springer
15 years 4 months ago
2007
Springer
81
Voted
LATINCRYPT
2010
14 years 8 months ago
2010
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
113
Voted
EUROCRYPT
2008
Springer
14 years 12 months ago
2008
Springer
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...
TCC
2010
Springer
15 years 7 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
FOCS
2002
IEEE
15 years 3 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...