224 search results - page 3 / 45 » Isolated Proofs of Knowledge and Isolated Zero Knowledge |
184
click to vote
EUROCRYPT
1999
Springer
15 years 10 months ago
1999
Springer
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge pro...
200
click to vote
FOCS
1999
IEEE
15 years 10 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...
174
click to vote
CRYPTO
2008
Springer
15 years 7 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...
181
Voted
CRYPTO
2000
Springer
15 years 10 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...
170
click to vote
TCC
2007
Springer
16 years 3 days ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...