| 2025 | TCC | SNARK Lower Bounds via Communication Complexity. | Rishabh Bhadauria, Alexander R. Block, Prantar Ghosh, Justin Thaler |
| 2024 | CRYPTO | Field-Agnostic SNARKs from Expand-Accumulate Codes. | Alexander R. Block, Zhiyong Fang, Jonathan Katz, Justin Thaler, Hendrik Waldner, Yupeng Zhang |
| 2024 | SCN | On the Concrete Security of Non-interactive FRI. | Alexander R. Block, Pratyush Ranjan Tiwari |
| 2023 | ASIACRYPT | Fiat-Shamir Security of FRI and Related SNARKs. | Alexander R. Block, Albert Garreta, Jonathan Katz, Justin Thaler, Pratyush Ranjan Tiwari, Michal Zajac |
| 2023 | ISIT | Computationally Relaxed Locally Decodable Codes, Revisited. | Alexander R. Block, Jeremiah Blocki |
| 2022 | SCN | Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. | Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki |
| 2021 | CRYPTO | Time- and Space-Efficient Arguments from Groups of Unknown Order. | Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni |
| 2021 | ISIT | Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. | Alexander R. Block, Jeremiah Blocki |
| 2020 | TCC | Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. | Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni |
| 2018 | INDOCRYPT | Secure Computation with Constant Communication Overhead Using Multiplication Embeddings. | Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen |
| 2018 | TCC | Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions). | Alexander R. Block, Divya Gupta, Hemanta K. Maji, Hai H. Nguyen |
| 2017 | CRYPTO | Secure Computation Based on Leaky Correlations: High Resilience Setting. | Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen |