| 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
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Proof-carrying data from arithmetized random oracles
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
A toolbox for barriers on interactive oracle proofs
Theory of Cryptography | 2023-08-14 | Paper |
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
SIAM Journal on Computing | 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 |
scientific article; zbMATH DE number 7650374 (Why is no real title available?)
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650405 (Why is no real title available?)
| 2023-02-03 | Paper |
Testing linearity against non-signaling strategies
ACM Transactions on Computation Theory | 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
Journal of Cryptology | 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
Journal of the ACM | 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
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
On axis-parallel tests for tensor product codes
Theory of Computing | 2020-12-17 | Paper |
scientific article; zbMATH DE number 7250157 (Why is no real title available?)
| 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
SIAM Journal on Applied Algebra and Geometry | 2019-05-08 | Paper |
Knightian analysis of the Vickrey mechanism
Econometrica | 2019-01-30 | Paper |
The hunting of the SNARK
Journal of Cryptology | 2018-02-15 | Paper |
Zero knowledge protocols from succinct constraint detection
| 2018-01-19 | Paper |
Scalable zero knowledge via cycles of elliptic curves
Algorithmica | 2018-01-05 | Paper |
Computational integrity with a public random string from quasi-linear PCPs
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Interactive oracle proofs
Theory of Cryptography | 2016-12-22 | Paper |
From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Mechanism design with approximate valuations
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Quasi-linear size zero knowledge from linear-algebraic PCPs
Theory of Cryptography | 2016-04-08 | Paper |
Cluster computing in zero knowledge
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Shorter arithmetization of nondeterministic computations
Theoretical Computer Science | 2015-09-16 | Paper |
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Scalable zero knowledge via cycles of elliptic curves
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Recursive composition and bootstrapping for SNARKs and proof-carrying data
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Improved soundness for QMA with multiple provers
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
Snarks for C: verifying program executions succinctly and in zero knowledge
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Theory of Cryptography | 2013-03-18 | Paper |
Problems of non-relativistic quantum mechanics
UNITEXT | 2013-01-15 | Paper |
Succinct arguments from multi-prover interactive proofs and their efficiency benefits
Lecture Notes in Computer Science | 2012-09-25 | Paper |
