93 search results - page 2 / 19 » Unifying Zero-Knowledge Proofs of Knowledge |
110
click to vote
EUROCRYPT
2008
Springer
14 years 11 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...
131
click to vote
TCC
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., noninteractive) proof system. We show that, under ...
74
Voted
PROVSEC
2007
Springer
15 years 3 months ago
2007
Springer
ASIACRYPT
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
91
Voted
EUROCRYPT
1999
Springer
15 years 1 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...