93 search results - page 3 / 19 » Unifying Zero-Knowledge Proofs of Knowledge |
117
click to vote
ASIACRYPT
2010
Springer
14 years 11 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...
124
click to vote
CRYPTO
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
144
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
114
click to vote
CRYPTO
2008
Springer
15 years 3 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
104
click to vote
TCC
2010
Springer
15 years 10 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...