Welcome to the resource topic for 2019/640
Title:
On Round Optimal Statistical Zero Knowledge Arguments
Authors: Nir Bitansky, Omer Paneth
Abstract:We construct the first three message statistical zero knowledge arguments for all of NP, matching the known lower bound. We do so based on keyless multi-collision resistant hash functions and other standard primitives (based on the Learning with Errors assumption) — the same assumptions used to obtain round optimal computational zero knowledge. The main component in our constructions is a statistically witness indistinguishable argument of knowledge based on a new notion of statistically hiding commitments with subset opening.
ePrint: https://eprint.iacr.org/2019/640
Talk: https://www.youtube.com/watch?v=8fIko3oISFs
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 .