A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081)

The known construction of a constant round zero-knowledge argument for NP which is secure against quantum attacks achieved only computational soundness, requires strong assumptions of quantum hardness of learning with errors as well as the existence of a quantum fully homomorphic encryption and relies on non-black-box simulation. By replacing the zero-knowledge to so-called \(\varepsilon \)-zero-knowledge a constant round interactive proof for NP is constructed that satisfies statistical soundness and black-box \(\varepsilon \)-zero-knowledge against quantum attacks assuming the existence of collapsing hash functions. Assuming the existence of post-quantum one-way functions, a constant round interactive argument for NP is presented that satisfies computational soundness and black-box \(\varepsilon \)-zero-knowledge against quantum attacks. For the entire collection see [Zbl 1483.94004].