Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)

DOI10.1145/3406325.3451116OpenAlexW3172178640MaRDI QIDQ6087041

Ron D. Rothblum, Alex Lombardi, Justin Holmgren

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451116

zbMATH Keywords

cryptographic protocolszero-knowledge protocolsFiat-Shamir heuristiclist-recoverable codes

Mathematics Subject Classification ID

Communication complexity, information complexity (68Q11)

Related Items (10)

One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Triply adaptive UC NIZK ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs

This page was built for publication: Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)