Computational integrity with a public random string from quasi-linear PCPs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1263221 (Why is no real title available?)
- scientific article; zbMATH DE number 708807 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1559565 (Why is no real title available?)
- Additive Fast Fourier Transforms Over Finite Fields
- Algebraic methods for interactive proof systems
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Computationally Sound Proofs
- Computing Partitions with Applications to the Knapsack Problem
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive oracle proofs
- Languages with efficient zero-knowledge PCPs are in SZK
- Locally testable codes and PCPs of almost-linear length
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- On Efficient Zero-Knowledge PCPs
- On the concrete efficiency of probabilistically-checkable proofs
- Polynomial Codes Over Certain Finite Fields
- Practical verified computation with streaming interactive proofs
- Probabilistic checking of proofs
- 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
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Round-efficient sub-linear zero-knowledge arguments for linear algebra
- Scalable zero knowledge via cycles of elliptic curves
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Short PCPs with Polylog Query Complexity
- Short pairing-based non-interactive zero-knowledge arguments
- Shorter arithmetization of nondeterministic computations
- Small PCPs with low query complexity
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Some optimal inapproximability results
- Succinct non-interactive arguments via linear interactive proofs
- The Knowledge Complexity of Interactive Proof Systems
- The PCP theorem by gap amplification
- Time-optimal interactive proofs for circuit evaluation
- Two-query PCP with subconstant error
- Zero-knowledge proofs from secure multiparty computation
Cited in
(16)- Hamming weight proofs of proximity with one-sided error
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
- On the (In)security of Kilian-based SNARGs
- Polynomial IOPs for memory consistency checks in zero-knowledge virtual machines
- A compressed \(\varSigma \)-protocol theory for lattices
- Does Fiat-Shamir require a cryptographic hash function?
- Ligero: lightweight sublinear arguments without a trusted setup
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Linear-size constant-query IOPs for delegating computation
- Incrementally verifiable computation via incremental PCPs
- Fast transforms over finite fields of characteristic two
- Multikey fully homomorphic encryption and applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- A toolbox for barriers on interactive oracle proofs
This page was built for publication: Computational integrity with a public random string from quasi-linear PCPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270376)
