| 2026 | CRYPTO | Chopin: Optimal Pairing-Based Multilinear Polynomial Commitments from Bivariate KZG. | Juraj Belohorec, Pavel Hubcek, Aleksi Kalsta, Kristna Maskov |
| 2026 | PKC | Simple Attacks Against (Extended) Fiat-Shamir. | Chris Brzuska, Pavel Hubcek, Aleksi Kalsta |
| 2025 | CRYPTO | On Extractability of the KZG Family of Polynomial Commitment Schemes. | Juraj Belohorec, Pavel Dvork, Charlotte Hoffmann, Pavel Hubcek, Kristna Maskov, Martin Pastyrk |
| 2025 | OPODIS | Foundations of Fiat-Denominated Loans Collateralized by Cryptocurrencies. | Pavel Hubcek, Jan Vclavek, Michelle Yeo |
| 2023 | PKC | Certifying Giant Nonprimes. | Charlotte Hoffmann, Pavel Hubcek, Chethan Kamath, Krzysztof Pietrzak |
| 2023 | TCC | (Verifiable) Delay Functions from Lucas Sequences. | Charlotte Hoffmann, Pavel Hubcek, Chethan Kamath, Toms Krnk |
| 2022 | CRYPTO | Practical Statistically-Sound Proofs of Exponentiation in Any Group. | Charlotte Hoffmann, Pavel Hubcek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak |
| 2021 | MFCS | On Search Complexity of Discrete Logarithm. | Pavel Hubcek, Jan Vclavek |
| 2020 | TCC | On Average-Case Hardness in TFNP from One-Way Functions. | Pavel Hubcek, Chethan Kamath, Karel Krl, Veronika Slvov |
| 2019 | STOC | Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. | Arka Rai Choudhuri, Pavel Hubcek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum |
| 2019 | TCC | Stronger Lower Bounds for Online ORAM. | Pavel Hubcek, Michal Kouck, Karel Krl, Veronika Slvov |
| 2018 | CRYPTO | Must the Communication Graph of MPC Protocols be an Expander? | Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubcek |
| 2018 | EuroCrypt | An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. | Pavel Hubcek, Alon Rosen, Margarita Vald |
| 2018 | ICALP | ARRIVAL: Next Stop in CLS. | Bernd Grtner, Thomas Dueholm Hansen, Pavel Hubcek, Karel Krl, Hagar Mosaad, Veronika Slvov |
| 2017 | SODA | Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. | Pavel Hubcek, Eylon Yogev |
| 2016 | TCC | Rational Sumchecks. | Siyao Guo, Pavel Hubcek, Alon Rosen, Margarita Vald |
| 2015 | SAGT | When Can Limited Randomness Be Used in Repeated Games? | Pavel Hubcek, Moni Naor, Jonathan R. Ullman |
| 2013 | CRYPTO | Limits on the Power of Cryptographic Cheap Talk. | Pavel Hubcek, Jesper Buus Nielsen, Alon Rosen |