On the (In)security of Kilian-based SNARGs
From MaRDI portal
Publication:2175953
DOI10.1007/978-3-030-36033-7_20zbMath1455.94120OpenAlexW2989730817MaRDI QIDQ2175953
Fermi Ma, James Bartusek, Justin Holmgren, Ron D. Rothblum, Liron Bronfman
Publication date: 30 April 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-36033-7_20
Related Items
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, SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption, Somewhere statistical soundness, post-quantum security, and SNARGs, Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
Cites Work
- Unnamed Item
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- The hunting of the SNARK
- Complexity of a determinate algorithm for the discrete logarithm
- On the (In)security of Kilian-based SNARGs
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Aurora: transparent succinct arguments for R1CS
- Security Proofs for Signature Schemes
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Proof verification and the hardness of approximation problems
- Interactive Oracle Proofs
- Universal Arguments and their Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Fiat-Shamir: from practice to theory
- On the existence of extractable one-way functions
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Advances in Cryptology – CRYPTO 2004
- Constant-round interactive proofs for delegating computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Some optimal inapproximability results
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the Size of Pairing-Based Non-interactive Arguments
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Cryptography and Coding
