Proving as fast as computing: succinct arguments with constant prover overhead
From MaRDI portal
Cites work
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- A combination of testability and decodability by tensor products
- A PCP theorem for interactive proofs and applications
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Algebraic methods for interactive proof systems
- Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
- Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans
- Aurora: transparent succinct arguments for R1CS
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Computationally Sound Proofs
- Constant-round interactive proofs for delegating computation
- Cryptography with constant computational overhead
- Expander codes
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Fast Reed-Solomon interactive oracle proofs of proximity
- Faster sounder succinct arguments and \textsf{IOP}s
- Fiat-Shamir: from practice to theory
- General secure multi-party computation from any linear secret-sharing scheme
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1033441 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- scientific article; zbMATH DE number 7706037 (Why is no real title available?)
- Interactive oracle proofs
- Interactive oracle proofs with constant rate and query complexity
- IP = PSPACE using error-correcting codes
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear-size Boolean circuits for multiselection
- Linear-time arguments with sublinear verification from tensor codes
- Linear-time encodable and decodable error-correcting codes
- Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Local proofs approaching the witness length (extended abstract)
- Locally computable UOWHF with linear shrinkage
- Low-complexity cryptographic hash functions
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On linear-size pseudorandom generators and hardcore functions
- On the concrete efficiency of probabilistically-checkable proofs
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Polynomial Codes Over Certain Finite Fields
- Practical verified computation with streaming interactive proofs
- Probabilistic checking of proofs
- Relaxed locally correctable codes
- Robust Local Testability of Tensor Products of LDPC Codes
- Robust locally testable codes and products of codes
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Scalable zero knowledge with no trusted setup
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Short PCPs with Polylog Query Complexity
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- STIR: Reed-Solomon proximity testing with fewer queries
- Transparent SNARKs from DARK compilers
- Zero-knowledge proofs from secure multiparty computation
Cited in
(2)
This page was built for publication: Proving as fast as computing: succinct arguments with constant prover overhead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6966597)
