Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW Is Not Zero-Knowledge)
Main Authors: | Holmgren, Justin, Lombardi, Alex, Rothblum, Ron D. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2022
|
Online Access: | https://hdl.handle.net/1721.1/145916 |
Similar Items
-
Provable Instantiations of Correlation Intractability and the Fiat-Shamir Heuristic
by: Lombardi, Alex
Published: (2023) -
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs
by: Lombardi, Alex, et al.
Published: (2021) -
Attacks on the Fiat-Shamir paradigm and program obfuscation
by: Tauman Kalai, Yael
Published: (2006) -
GMW 2022 – Hybridformat
by: Katharina Kaiser-Müller
Published: (2022-06-01) -
UPM anjur Program Penutupan GMW2023
by: Mohd Azhari, Nurul Ezzaty
Published: (2023)