Pairing-based batch arguments for NP with a linear-size CRS
From MaRDI portal
Cites work
- Boosting batch arguments and RAM delegation
- Constant-Size Commitments to Polynomials and Their Applications
- Correlation intractability and SNARGs from sub-exponential DDH
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Incrementally verifiable computation via rate-1 batch arguments
- Integer Sets Containing No Arithmetic Progressions
- Integer sets containing no arithmetic progressions
- Monotone policy BARGs from BARGs and additively homomorphic encryption
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Non-interactive publicly-verifiable delegation of committed programs
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On some sequences of integers.
- On the size of pairing-based non-interactive arguments
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Rate-1 non-interactive arguments for batch-NP and applications
- Rate-1 statistical non-interactive zero-knowledge
- Short pairing-based non-interactive zero-knowledge arguments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Square span programs with applications to succinct NIZK arguments
- Succinct non-interactive arguments via linear interactive proofs
- The random oracle methodology, revisited.
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
This page was built for publication: Pairing-based batch arguments for NP with a linear-size CRS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232572)
