| 2026 | STOC | Adaptive Robustness of Hypergrid Johnson-Lindenstrauss. | Andrej Bogdanov, Alon Rosen, Neekon Vafa, Vinod Vaikuntanathan |
| 2025 | CRYPTO | Sample Efficient Search to Decision for kLIN. | Andrej Bogdanov, Alon Rosen, Kel Zin Tan |
| 2024 | CRYPTO | CDS Composition of Multi-round Protocols. | Masayuki Abe, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen, Zehua Shang, Mehdi Tibouchi |
| 2024 | TCC | Low-Degree Security of the Planted Random Subgraph Problem. | Andrej Bogdanov, Chris Jones, Alon Rosen, Ilias Zadik |
| 2023 | ICALP | Nondeterministic Interactive Refutations for Nearest Boolean Vector. | Andrej Bogdanov, Alon Rosen |
| 2023 | TCC | Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method. | Andrej Bogdanov, Pravesh K. Kothari, Alon Rosen |
| 2022 | TCC | Public-Key Encryption from Homogeneous CLWE. | Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen |
| 2021 | ICALP | Direct Sum and Partitionability Testing over General Groups. | Andrej Bogdanov, Gautam Prakriya |
| 2021 | TCC | Acyclicity Programming for Sigma-Protocols. | Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen |
| 2020 | ASIACRYPT | Non-interactive Composition of Sigma-Protocols via Share-then-Hash. | Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen |
| 2019 | CRYPTO | Unconditionally Secure Computation Against Low-Complexity Leakage. | Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan |
| 2019 | ISIT | When are large codes possible for AVCs? | Xishi Nicholas Wang, Amitalok J. Budkuley, Andrej Bogdanov, Sidharth Jaggi |
| 2019 | SODA | XOR Codes and Sparse Learning Parity with Noise. | Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan |
| 2018 | ICALP | Small Bias Requires Large Formulas. | Andrej Bogdanov |
| 2017 | ICALP | Approximate Bounded Indistinguishability. | Andrej Bogdanov, Christopher Williamson |
| 2016 | CRYPTO | Bounded Indistinguishability and the Complexity of Recovering Secrets. | Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson |
| 2016 | TCC | Threshold Secret Sharing Requires a Linear Size Alphabet. | Andrej Bogdanov, Siyao Guo, Ilan Komargodski |
| 2016 | TCC | On the Hardness of Learning with Rounding over Small Modulus. | Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen |
| 2016 | TCC | Homomorphic Evaluation Requires Depth. | Andrej Bogdanov, Chin Ho Lee |
| 2015 | TCC | On Basing Size-Verifiable One-Way Functions on NP-Hardness. | Andrej Bogdanov, Christina Brzuska |
| 2013 | CRYPTO | Limits of Provable Security for Homomorphic Encryption. | Andrej Bogdanov, Chin Ho Lee |
| 2012 | TCC | A Dichotomy for Local Small-Bias Generators. | Benny Applebaum, Andrej Bogdanov, Alon Rosen |
| 2011 | FOCS | Pseudorandomness for Read-Once Formulas. | Andrej Bogdanov, Periklis A. Papakonstantinou, Andrew Wan |
| 2011 | MFCS | Hard Functions for Low-Degree Polynomials over Prime Fields. | Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka |
| 2011 | TCC | Input Locality and Hardness Amplification. | Andrej Bogdanov, Alon Rosen |
| 2007 | FOCS | Hardness Amplification for Errorless Heuristics. | Andrej Bogdanov, Muli Safra |
| 2007 | FOCS | Pseudorandom Bits for Polynomials. | Andrej Bogdanov, Emanuele Viola |
| 2005 | STOC | Pseudorandom generators for low degree polynomials. | Andrej Bogdanov |
| 2004 | INFOCOM | Power-aware base station positioning for sensor networks. | Andrej Bogdanov, Elitza N. Maneva, Samantha J. Riesenfeld |
| 2003 | FOCS | On Worst-Case to Average-Case Reductions for NP Problems. | Andrej Bogdanov, Luca Trevisan |
| 2002 | FOCS | A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs. | Andrej Bogdanov, Kenji Obata, Luca Trevisan |
| 2002 | FORTE | Mechanical Translation of I/O Automaton Specifications into First-Order Logic. | Andrej Bogdanov, Stephen J. Garland, Nancy A. Lynch |