Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient zero-knowledge proofs of knowledge without intractability assumptions (2000).
| Content Provider | CiteSeerX |
|---|---|
| Author | Cramer, Ronald Damgård, Ivan Mackenzie, Philip |
| Abstract | We initiate the investigation of the class of relations that admit extremely efficient perfect zero knowledge proofs of knowledge: constant number of rounds, communication linear in the length of the statement and the witness, and negligible knowledge error. In its most general incarnation, our result says that for relations that have a particular three-move honest-verifier zero-knowledge (HVZK) proof of knowledge, and which admit a particular three-move HVZK proof of knowledge for an associated commitment relation, perfect zero knowledge (against a general verifier) can be achieved essentially for free, even when proving statements on several instances combined under under monotone function composition. In addition, perfect zero-knowledge is achieved with an optimal 4-moves. Instantiations of our main protocol lead to efficient perfect ZK proofs of knowledge of discrete logarithms and RSA-roots, or more generally, q-one-way group homomorphisms. None of our results rely... |
| File Format | |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Knowledge Without Intractability Assumption Efficient Zero-knowledge Proof Constant Number General Verifier Communication Linear Perfect Zero-knowledge Efficient Perfect Zk Proof Discrete Logarithm Main Protocol Lead Efficient Perfect Zero Knowledge Proof Several Instance Negligible Knowledge Error Q-one-way Group Homomorphism Optimal 4-moves Monotone Function Composition Particular Three-move Hvzk Proof General Incarnation Particular Three-move Honest-verifier Zero-knowledge Associated Commitment Relation |
| Content Type | Text |