Limits on the Power of Cryptographic Cheap Talk. - Pavel Hubácek; Jesper Buus Nielsen; Alon Rosen (IACR Cryptol. ePrint Arch., 2013)

Rational arguments: single round delegation with sublinear verification. - Siyao Guo; Pavel Hubácek; Alon Rosen; Margarita Vald (ITCS, 2014)

Cryptographically blinded games: leveraging players' limitations for equilibria and profit. - Pavel Hubácek; Sunoo Park (EC, 2014)

On the Communication Complexity of Secure Function Evaluation with Long Output. - Pavel Hubácek; Daniel Wichs (IACR Cryptol. ePrint Arch., 2014)

Rational Sumchecks. - Siyao Guo; Pavel Hubácek; Alon Rosen; Margarita Vald (IACR Cryptol. ePrint Arch., 2015)

The Journey from NP to TFNP Hardness. - Pavel Hubácek; Moni Naor; Eylon Yogev (Electron. Colloquium Comput. Complex., 2016)

When Can Limited Randomness Be Used in Repeated Games? - Pavel Hubácek; Moni Naor; Jonathan R. Ullman (Theory Comput. Syst., 2016)

Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. - Iddo Bentov; Pavel Hubácek; Tal Moran; Asaf Nadler (IACR Cryptol. ePrint Arch., 2017)

ARRIVAL: Next Stop in CLS. - Bernd Gärtner; Thomas Dueholm Hansen; Pavel Hubácek; Karel Král 002; Hagar Mosaad; Veronika Slívová (ICALP, 2018)

An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. - Pavel Hubácek; Alon Rosen; Margarita Vald (IACR Cryptol. ePrint Arch., 2018)

Stronger Lower Bounds for Online ORAM. - Pavel Hubácek; Michal Koucký 001; Karel Král 002; Veronika Slívová (TCC (2), 2019)

Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. - Arka Rai Choudhuri; Pavel Hubácek; Chethan Kamath; Krzysztof Pietrzak; Alon Rosen; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2019)

PPAD-Hardness via Iterated Squaring Modulo a Composite. - Arka Rai Choudhuri; Pavel Hubácek; Chethan Kamath; Krzysztof Pietrzak; Alon Rosen; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2019)

On Average-Case Hardness in TFNP from One-Way Functions. - Pavel Hubácek; Chethan Kamath; Karel Král 002; Veronika Slívová (IACR Cryptol. ePrint Arch., 2020)

Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. - Pavel Hubácek; Eylon Yogev (SIAM J. Comput., 2020)

On Search Complexity of Discrete Logarithm. - Pavel Hubácek; Jan Václavek (MFCS, 2021)

PPP-Completeness and Extremal Combinatorics. - Romain Bourneuf; Lukás Folwarczný; Pavel Hubácek; Alon Rosen; Nikolaj I. Schwartzbach (Electron. Colloquium Comput. Complex., 2022)

Practical Statistically-Sound Proofs of Exponentiation in any Group. - Charlotte Hoffmann; Pavel Hubácek; Chethan Kamath; Karen Klein; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2022)

On The Distributed Discrete Logarithm Problem with Preprocessing. - Pavel Hubácek; L'ubica Jancová; Veronika Králová (IACR Cryptol. ePrint Arch., 2022)

One-Way Functions vs. TFNP: Simpler and Improved. - Lukás Folwarczný; Mika Göös; Pavel Hubácek; Gilbert Maystre; Weiqiang Yuan 002 (IACR Cryptol. ePrint Arch., 2023)

(Verifiable) Delay Functions from Lucas Sequences. - Charlotte Hoffmann; Pavel Hubácek; Chethan Kamath; Tomás Krnák (IACR Cryptol. ePrint Arch., 2023)

Certifying Giant Nonprimes. - Charlotte Hoffmann; Pavel Hubácek; Chethan Kamath; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2023)

Must the Communication Graph of MPC Protocols be an Expander? - Elette Boyle; Ran Cohen; Deepesh Data; Pavel Hubácek (J. Cryptol., 2023)

TFNP Intersections Through the Lens of Feasible Disjunction. - Pavel Hubácek; Erfan Khaniki; Neil Thapen (ITCS, 2024)

Practical Batch Proofs of Exponentiation. - Charlotte Hoffmann; Pavel Hubácek; Svetlana Ivanova (IACR Cryptol. ePrint Arch., 2024)

On Extractability of the KZG Family of Polynomial Commitment Schemes. - Juraj Belohorec; Pavel Dvorák; Charlotte Hoffmann; Pavel Hubácek; Kristýna Masková; Martin Pastyrík (IACR Cryptol. ePrint Arch., 2025)