On the (In)security of Kilian-based SNARGs
From MaRDI portal
Publication:2175953
Recommendations
Cites work
- Advances in Cryptology – CRYPTO 2004
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Aurora: transparent succinct arguments for R1CS
- Complexity of a determinate algorithm for the discrete logarithm
- Computational integrity with a public random string from quasi-linear PCPs
- Computationally Sound Proofs
- Constant-round interactive proofs for delegating computation
- Cryptography and Coding
- Fast Reed-Solomon interactive oracle proofs of proximity
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Fiat-Shamir: from practice to theory
- From obfuscation to the security of Fiat-Shamir for proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- Interactive oracle proofs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the (In)security of Kilian-based SNARGs
- On the communication complexity of secure function evaluation with long output
- On the existence of extractable one-way functions
- On the size of pairing-based non-interactive arguments
- Proof verification and the hardness of approximation problems
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Security proofs for signature schemes
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Some optimal inapproximability results
- Succinct non-interactive arguments via linear interactive proofs
- The hunting of the SNARK
- Universal Arguments and their Applications
Cited in
(14)- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- On the (In)security of Kilian-based SNARGs
- Somewhere statistical soundness, post-quantum security, and SNARGs
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
- Fiat-Shamir security of FRI and related SNARKs
- On the concrete security of non-interactive FRI
- Towards a white-box secure Fiat-Shamir transformation
- How to prove false statements: practical attacks on Fiat-Shamir
- Security bounds for proof-carrying data from straightline extractors
- Linear prover IOPs in log star rounds
- Simple attacks against (extended) Fiat-Shamir
This page was built for publication: On the (In)security of Kilian-based SNARGs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175953)
