Loading...
Please wait, while we are loading the content...
Similar Documents
Short non-interactive cryptographic proofs (2000).
| Content Provider | CiteSeerX |
|---|---|
| Author | Boyar, Joan Damgård, Ivan Peralta, René |
| Abstract | We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. We assume the theorem is represented by a boolean circuit, of size m gates, which is satisfiable if and only if the theorem holds. We use bit commitments of size k and bound the probability of false proofs going undetected by 2 r . We obtain non-interactive zero-knowledge proofs of size O(mk(log m + r)) bits. In the random oracle model, we obtain non-interactive proofs of size O(m(log m + r) + r k) bits. By simulating a random oracle, we obtain non-interactive proofs which are short enough to be used in practice. We call the latter proofs "discreet". |
| File Format | |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Short Non-interactive Cryptographic Proof Non-interactive Proof Random Oracle False Proof Size Gate Bit Commitment Short Proof Latter Proof Discreet Boolean Circuit Random Oracle Model Non-interactive Zero-knowledge Proof |
| Content Type | Text |
