Pairing-based SNARGs with two group elements
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
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Complexity of a determinate algorithm for the discrete logarithm
- Computationally Sound Proofs
- Cryptography and Coding
- Designated-verifier SNARGs with one group element
- Dot-product proofs and their applications
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fast Reed-Solomon interactive oracle proofs of proximity
- Gowers uniformity, influence of variables, and PCPs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to use indistinguishability obfuscation
- Interactive oracle proofs
- IOPs with inverse polynomial soundness error
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Lattice-based SNARGs and their application to more efficient obfuscation
- Lower bound on SNARGs in the random oracle model
- On succinct arguments and witness encryption from groups
- On the size of pairing-based non-interactive arguments
- Polymath: Groth16 is not the limit
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Proof verification and the hardness of approximation problems
- Quadratic span programs and succinct NIZKs without PCPs
- Scalable zero knowledge with no trusted setup
- Short pairing-based non-interactive zero-knowledge arguments
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Square span programs with applications to succinct NIZK arguments
- STIR: Reed-Solomon proximity testing with fewer queries
- Subvector commitments with application to succinct arguments
- Succinct non-interactive arguments via linear interactive proofs
- Sufficient conditions for collision-resistant hashing
- The algebraic group model and its applications
- The pseudorandom oracle model and ideal obfuscation
- WHIR: Reed-Solomon proximity testing with super-fast verification
This page was built for publication: Pairing-based SNARGs with two group elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443623)