| Publication | Date of Publication | Type |
|---|
Plumo: an ultralight blockchain client
Financial Cryptography and Data Security | 2023-05-26 | Paper |
| \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments | 2022-03-31 | Paper |
| Interactive oracle proofs with constant rate and query complexity | 2020-05-27 | Paper |
Twenty (short) questions
Combinatorica | 2019-09-04 | Paper |
| Zero knowledge protocols from succinct constraint detection | 2018-01-19 | Paper |
Twenty (simple) questions
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Almost optimal cover-free families
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Computational integrity with a public random string from quasi-linear PCPs
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Deterministic extractors for additive sources (extended abstract)
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Subspace Polynomials and Cyclic Subspace Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Distribution design
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Quasi-linear size zero knowledge from linear-algebraic PCPs
Theory of Cryptography | 2016-04-08 | Paper |
The \(k\)-distinct language: parameterized automata constructions
Theoretical Computer Science | 2016-02-26 | Paper |
Fast algorithms for parameterized problems with relaxed disjointness constraints
Algorithms - ESA 2015 | 2015-11-19 | Paper |
The \(k\)-distinct language: parameterized automata constructions
Parameterized and Exact Computation | 2015-09-15 | Paper |
On r-Simple k-Path
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Extractors for polynomial sources over fields of constant order and small characteristic
Theory of Computing | 2014-10-06 | Paper |
Non-interactive secure multiparty computation
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Invertible zero-error dispersers and defective memory with stuck-at errors
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Increasing the output length of zero-error dispersers
Random Structures & Algorithms | 2012-03-07 | Paper |
Extractors and rank extractors for polynomial sources
Computational Complexity | 2011-02-18 | Paper |
Deterministic extraction from weak random sources.
Monographs in Theoretical Computer Science. An EATCS Series | 2010-09-28 | Paper |
Deterministic extractors for affine sources over large fields
Combinatorica | 2009-07-20 | Paper |
Increasing the Output Length of Zero-Error Dispersers
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
SIAM Journal on Computing | 2007-09-07 | Paper |
