152 search results - page 3 / 31 » Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use |
17
Voted
FOCS
2002
IEEE
14 years 11 days ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
TCC
2004
Springer
14 years 23 days 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 ...
EUROCRYPT
1999
Springer
13 years 11 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...
AFRICACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present a simple zero-knowledge proof of knowledge protocol of which many protocols in the literature are instantiations. These include Schnorr’s protocol for provin...
FC
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. This work introduces a new tool for a fund manager to verifiably communicate portfolio risk characteristics to an investor. We address the classic dilemma: How can an in...