Unique SNARGs with adaptive security: constructions and black-box separations
From MaRDI portal
Cites work
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Adaptive security in SNARGs via iO and lossy functions
- Adaptively sound zero-knowledge SNARKs for UP
- Advances in Cryptology - CRYPTO 2003
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
- Breaking RSA may not be equivalent to factoring. (Extended abstract)
- Constant-round concurrent zero knowledge from P-certificates
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- Constrained pseudorandom functions and their applications
- Continuous verifiable delay functions
- Correlation intractability and SNARGs from sub-exponential DDH
- Delegation for bounded space
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- Functional signatures and pseudorandom functions
- How to delegate computations
- How to delegate computations publicly
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Impossibilities in succinct arguments: black-box extraction and more
- Incompressible encodings
- Incrementally verifiable computation for NP from standard assumptions
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Limits of provable security from standard assumptions
- On round-efficient argument systems
- On the power of nonuniformity in proofs of security
- On the Security of One-Witness Blind Signature Schemes
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- 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
- SNARGs for monotone policy batch NP
- SNARGs for P from sub-exponential DDH and QR
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Theory of Cryptography
- Theory of Cryptography
- Towards non-black-box lower bounds in cryptography
- Uniform black-box separations via non-malleable extractors
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Why ``Fiat-Shamir for proofs lacks a proof
- Witness maps and applications
This page was built for publication: Unique SNARGs with adaptive security: constructions and black-box separations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443208)