Welcome to the resource topic for 2014/991
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation
Authors: Kai-Min Chung, Huijia Lin, Rafael PassAbstract:
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations, and indistinguishability obfuscators for P/poly (with slightly super-polynomial security).
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 .