| Publication | Date of Publication | Type |
|---|
| STIR: Reed-Solomon proximity testing with fewer queries | 2025-01-10 | Paper |
| Hardness of approximation for stochastic problems via interactive oracle proofs | 2024-07-05 | Paper |
| Lattice-based succinct arguments for NP with polylogarithmic-time verification | 2024-02-02 | Paper |
| Proof-carrying data from arithmetized random oracles | 2023-12-08 | Paper |
| A toolbox for barriers on interactive oracle proofs | 2023-08-14 | Paper |
| Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity | 2023-04-04 | Paper |
| Tight security bounds for Micali's SNARGs | 2023-03-31 | Paper |
| Finite-strain Poynting-Thomson model: existence and linearization | 2023-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875720 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875760 | 2023-02-03 | Paper |
| Testing linearity against non-signaling strategies | 2022-12-05 | Paper |
| A PCP theorem for interactive proofs and applications | 2022-08-30 | Paper |
| Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier | 2022-08-30 | Paper |
| On succinct non-interactive arguments in relativized worlds | 2022-08-30 | Paper |
| Gemini: elastic SNARKs for diverse environments | 2022-08-30 | Paper |
| Probabilistic checking against non-signaling strategies from linearity testing | 2022-07-18 | Paper |
| Succinct non-interactive arguments via linear interactive proofs | 2022-05-10 | Paper |
| Sumcheck arguments and their applications | 2022-03-31 | Paper |
| Proof-carrying data without succinct arguments | 2022-03-31 | Paper |
| Subquadratic SNARGs in the random oracle model | 2022-03-31 | Paper |
| Spatial Isolation Implies Zero Knowledge Even in a Quantum World | 2022-03-31 | Paper |
| Recursive proof composition from accumulation schemes | 2022-03-23 | Paper |
| Linear-time arguments with sublinear verification from tensor codes | 2022-03-23 | Paper |
| Barriers for succinct arguments in the random oracle model | 2022-03-23 | Paper |
| Marlin: preprocessing zkSNARKs with universal and updatable SRS | 2021-12-01 | Paper |
| \textsc{Fractal}: post-quantum and transparent recursive proofs from holography | 2021-12-01 | Paper |
| On axis-parallel tests for tensor product codes | 2021-07-28 | Paper |
| Proofs of proximity for distribution testing | 2021-06-15 | Paper |
| Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity | 2021-02-02 | Paper |
| On axis-parallel tests for tensor product codes | 2020-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121905 | 2020-09-22 | Paper |
| Interactive oracle proofs with constant rate and query complexity | 2020-05-27 | Paper |
| Succinct arguments in the quantum random oracle model | 2020-04-30 | Paper |
| Linear-size constant-query IOPs for delegating computation | 2020-04-30 | Paper |
| Aurora: transparent succinct arguments for R1CS | 2020-02-04 | Paper |
| On Cycles of Pairing-Friendly Elliptic Curves | 2019-05-08 | Paper |
| Knightian analysis of the Vickrey mechanism | 2019-01-30 | Paper |
| The hunting of the SNARK | 2018-02-15 | Paper |
| Zero knowledge protocols from succinct constraint detection | 2018-01-19 | Paper |
| Scalable zero knowledge via cycles of elliptic curves | 2018-01-05 | Paper |
| Computational integrity with a public random string from quasi-linear PCPs | 2017-06-23 | Paper |
| Fast reductions from RAMs to delegatable succinct constraint satisfaction problems | 2017-05-16 | Paper |
| Interactive oracle proofs | 2016-12-22 | Paper |
| From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again | 2016-10-07 | Paper |
| Mechanism design with approximate valuations | 2016-10-07 | Paper |
| Quasi-linear size zero knowledge from linear-algebraic PCPs | 2016-04-08 | Paper |
| Cluster computing in zero knowledge | 2015-09-30 | Paper |
| Shorter arithmetization of nondeterministic computations | 2015-09-16 | Paper |
| On the concrete efficiency of probabilistically-checkable proofs | 2014-08-07 | Paper |
| Scalable zero knowledge via cycles of elliptic curves | 2014-08-07 | Paper |
| Recursive composition and bootstrapping for SNARKs and proof-carrying data | 2014-08-07 | Paper |
| Improved soundness for QMA with multiple provers | 2014-05-07 | Paper |
| Snarks for C: verifying program executions succinctly and in zero knowledge | 2013-09-17 | Paper |
| Succinct non-interactive arguments via linear interactive proofs | 2013-03-18 | Paper |
| Problems of non-relativistic quantum mechanics | 2013-01-15 | Paper |
| Succinct arguments from multi-prover interactive proofs and their efficiency benefits | 2012-09-25 | Paper |
