How to prove false statements: practical attacks on Fiat-Shamir
From MaRDI portal
Cites work
- Algebraic methods for interactive proof systems
- Computationally Sound Proofs
- Correlation intractability and SNARGs from sub-exponential DDH
- Delegating computation: interactive proofs for muggles
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- From obfuscation to the security of Fiat-Shamir for proofs
- How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- On doubly-efficient interactive proof systems
- On the (In)security of Kilian-based SNARGs
- On the correlation intractability of obfuscated pseudorandom functions
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Scalable zero knowledge via cycles of elliptic curves
- Security arguments for digital signatures and blind signatures
- Separating succinct non-interactive arguments from all falsifiable assumptions
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- The random oracle methodology, revisited.
- Time-optimal interactive proofs for circuit evaluation
- Towards a white-box secure Fiat-Shamir transformation
- Unlocking the lookup singularity with \textsf{Lasso}
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
Cited in
(11)- Verifiable computation for approximate homomorphic encryption schemes
- On knowledge-soundness of Plonk in ROM from falsifiable assumptions
- On deniable authentication against malicious verifiers
- Quantum lifting for invertible permutations and ideal ciphers
- Towards a white-box secure Fiat-Shamir transformation
- Cryptography. Abstracts from the workshop held January 19--24, 2025
- Hybrid-query bounds with partial input control framework and application to tight M-eTCR
- Linear prover IOPs in log star rounds
- Plonk is simulation extractable in ROM under falsifiable assumptions
- DahLIAS: discrete logarithm-based interactive aggregate signatures
- The malice of ELFs: practical anamorphic-resistant encryption without random oracles
This page was built for publication: How to prove false statements: practical attacks on Fiat-Shamir
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866584)
