From obfuscation to the security of Fiat-Shamir for proofs

DOI10.1007/978-3-319-63715-0_8zbMath1409.94881OpenAlexW2752822516MaRDI QIDQ1680212

Guy N. Rothblum, Yael Tauman Kalai, Ron D. Rothblum

Publication date: 15 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63715-0_8

Related Items (36)

\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Interactive Oracle Proofs ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Proofs of Work from worst-case assumptions ⋮ Permuted puzzles and cryptographic hardness ⋮ On the (In)security of Kilian-based SNARGs ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ NIZK from SNARGs ⋮ Efficient NIZKs from LWE via polynomial reconstruction and ``MPC in the head ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ A new framework for quantum oblivious transfer ⋮ How to use (plain) witness encryption: registered ABE, flexible broadcast, and more ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Secure MPC: laziness leads to GOD ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Post-quantum resettably-sound zero knowledge ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Interactive proofs for social graphs ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ NIZK from LPN and trapdoor hash via correlation intractability for approximable relations ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

This page was built for publication: From obfuscation to the security of Fiat-Shamir for proofs