{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiajap7dix733tl2bpuhv2d4ciriyhccg2goul3mywjr2i7xeeqi3q",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mixatmuna2m2"
  },
  "path": "/report/2026/050",
  "publishedAt": "2026-04-07T15:04:58.000Z",
  "site": "https://eccc.weizmann.ac.il",
  "textContent": "In this paper we study the cryptographic complexity of non-trivial witness-indistinguishable ($WI$) arguments of knowledge. We establish that: - Assuming that $NP\\not\\subseteq P/poly,$ the existence of a constant-round computational $WI$ argument of knowledge for $NP$ implies that (infinitely-often) auxiliary-input one-way functions exist. - Assuming that $NP\\not\\subseteq P^{Sam}/poly,$ there is no black-box construction of a constant-round (unbounded-verifier) statistical $WI$ argument of knowledge from one-way permutations. Here, $Sam$ is the collision finder oracle of Haitner, Hoch, Reingold, and Segev [FOCS '07]. Moreover, we identify a natural class of knowledge extractors for which stronger versions of the above implications hold (e.g., even if the protocols have many rounds).",
  "title": "TR26-050 |  Witness-Indistinguishable Arguments of Knowledge and One-Way Functions | \n\n\tGal Arnon, \n\n\tNoam Mazor, \n\n\tRafael Pass, \n\n\tJad Silbak"
}