Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
From MaRDI portal
Publication:6637522
Recommendations
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Proving as fast as computing: succinct arguments with constant prover overhead
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Faster sounder succinct arguments and \textsf{IOP}s
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Boosting batch arguments and RAM delegation
- Constant rate PCPs for circuit-SAT with sublinear query complexity
- Constant-Size Commitments to Polynomials and Their Applications
- Constant-round interactive proofs for delegating computation
- Correlation intractability and SNARGs from sub-exponential DDH
- Delegating RAM Computations
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fast Reed-Solomon interactive oracle proofs of proximity
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to delegate computations
- How to delegate computations publicly
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Interactive oracle proofs with constant rate and query complexity
- Interactive proofs and the hardness of approximating cliques
- Limits of extractability assumptions with distributional auxiliary input
- Local zero knowledge
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Non-interactive delegation and batch NP verification from standard computational assumptions
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- On the concrete efficiency of probabilistically-checkable proofs
- On the existence of extractable one-way functions
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Parallel coin-tossing and constant-round secure two-party computation
- Parallelizable delegation from LWE
- Polynomial IOPs for linear algebra relations
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- SNARGs for P from sub-exponential DDH and QR
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for monotone policy batch NP
- SPARKs: succinct parallelizable arguments of knowledge
- Scalable zero knowledge with no trusted setup
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Short PCPs with Polylog Query Complexity
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Succinct delegation for low-space non-deterministic computation
- Succinct non-interactive arguments via linear interactive proofs
- The PCP theorem by gap amplification
- The hunting of the SNARK
- Time- and space-efficient arguments from groups of unknown order
- Transparent SNARKs from DARK compilers
- Universal Arguments and their Applications
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
Cited in
(3)
This page was built for publication: Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637522)
