Answers are grounded in this paper and cite their sources.
In a seminal work, Goldreich, Micali and Wigderson (CRYPTO ’86) demonstrated the wide applicability of zero-knowledge proofs by constructing such a proof system for the NP-complete problem of graph 3-coloring. A long-standing open question has been whether parallel repetition of their protocol preserves zero knowledge. In this work, we answer this question in the negative, assuming a standard cryptographic assumption (i.e., the hardness of learning with errors (LWE)).
No takes yet. Share an insight, caveat, or question.
Holmgren et al. (2021) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: