Constant-Round Concurrent Zero-Knowledge From Falsifiable Assumptions
| dc.contributor.author | Chung, Kai-Min | |
| dc.contributor.author | Lin, Huijia | |
| dc.contributor.author | Pass, Rafael | |
| dc.date.accessioned | 2012-10-02T19:37:33Z | |
| dc.date.available | 2012-10-02T19:37:33Z | |
| dc.date.issued | 2012-10-02 | |
| dc.description.abstract | We present a constant-round concurrent zero-knowledge protocol for $\NP$. Our protocol is sound against uniform polynomial-time attackers, and relies on the existence of families of collision-resistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly speaking, that Micali's non-interactive CS-proofs are sound for languages in $\P$. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/30398 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Concurrent ZK | en_US |
| dc.subject | Falsifiable Assumption | en_US |
| dc.subject | P-Certificates | en_US |
| dc.subject | Non-Black-Box Simulation | en_US |
| dc.title | Constant-Round Concurrent Zero-Knowledge From Falsifiable Assumptions | en_US |
| dc.type | technical report | en_US |
Files
Original bundle
1 - 1 of 1