Welcome to the resource topic for 2012/563
Title:
Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions
Authors: Kai-Min Chung, Huijia Lin, Rafael Pass
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.
ePrint: https://eprint.iacr.org/2012/563
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .