Pavel Hubácek

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 42

Top Topics

Profit Maximizing

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
One-Way Functions vs. TFNP: Simpler and Improved. ITCS (2024)
Charlotte Hoffmann, Pavel Hubácek, Svetlana Ivanova
Practical Batch Proofs of Exponentiation. IACR Cryptol. ePrint Arch. 2024 (2024)
Pavel Hubácek, Erfan Khaniki, Neil Thapen
TFNP Intersections Through the Lens of Feasible Disjunction. ITCS (2024)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak
Certifying Giant Nonprimes. Public Key Cryptography (1) (2023)
Romain Bourneuf, Lukas Folwarczny, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach
PPP-Completeness and Extremal Combinatorics. ITCS (2023)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak
Certifying Giant Nonprimes. IACR Cryptol. ePrint Arch. 2023 (2023)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? J. Cryptol. 36 (3) (2023)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák
(Verifiable) Delay Functions from Lucas Sequences. TCC (4) (2023)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? CoRR (2023)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák
(Verifiable) Delay Functions from Lucas Sequences. IACR Cryptol. ePrint Arch. 2023 (2023)
Lukas Folwarczny, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan
One-Way Functions vs. TFNP: Simpler and Improved. IACR Cryptol. ePrint Arch. 2023 (2023)
Romain Bourneuf, Lukas Folwarczny, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach
PPP-Completeness and Extremal Combinatorics. Electron. Colloquium Comput. Complex. (2022)
Pavel Hubácek, L'ubica Jancová, Veronika Králová
On The Distributed Discrete Logarithm Problem with Preprocessing. IACR Cryptol. ePrint Arch. 2022 (2022)
Romain Bourneuf, Lukas Folwarczny, Pavel Hubácek, Alon Rosen, Nikolaj Ignatieff Schwartzbach
PPP-Completeness and Extremal Combinatorics. CoRR (2022)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak
Practical Statistically-Sound Proofs of Exponentiation in Any Group. CRYPTO (2) (2022)
Pavel Hubácek, L'ubica Jancová, Veronika Králová
On the Distributed Discrete Logarithm Problem with Preprocessing. ITC (2022)
Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak
Practical Statistically-Sound Proofs of Exponentiation in any Group. IACR Cryptol. ePrint Arch. 2022 (2022)
Pavel Hubácek, Jan Václavek
On Search Complexity of Discrete Logarithm. CoRR (2021)
Pavel Hubácek, Jan Václavek
On Search Complexity of Discrete Logarithm. MFCS (2021)
Iddo Bentov, Pavel Hubácek, Tal Moran, Asaf Nadler
Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. CSCML (2021)
Pavel Hubácek, Eylon Yogev
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SIAM J. Comput. 49 (6) (2020)
Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová
On Average-Case Hardness in TFNP from One-Way Functions. IACR Cryptol. ePrint Arch. 2020 (2020)
Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová
On Average-Case Hardness in TFNP from One-Way Functions. TCC (3) (2020)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC (2019)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
PPAD-Hardness via Iterated Squaring Modulo a Composite. IACR Cryptol. ePrint Arch. 2019 (2019)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Electron. Colloquium Comput. Complex. 26 (2019)
Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová
Stronger Lower Bounds for Online ORAM. TCC (2) (2019)
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019 (2019)
Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová
Stronger Lower Bounds for Online ORAM. CoRR (2019)
Pavel Hubácek, Alon Rosen, Margarita Vald
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2018 (2018)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? IACR Cryptol. ePrint Arch. 2018 (2018)
Pavel Hubácek, Alon Rosen, Margarita Vald
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. EUROCRYPT (3) (2018)
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová
ARRIVAL: Next Stop in CLS. ICALP (2018)
Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek
Must the Communication Graph of MPC Protocols be an Expander? CRYPTO (3) (2018)
Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová
ARRIVAL: Next Stop in CLS. CoRR (2018)
Iddo Bentov, Pavel Hubácek, Tal Moran, Asaf Nadler
Tortoise and Hares Consensus: the Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies. IACR Cryptol. ePrint Arch. 2017 (2017)
Pavel Hubácek, Moni Naor, Eylon Yogev
The Journey from NP to TFNP Hardness. ITCS (2017)
Pavel Hubácek, Eylon Yogev
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SODA (2017)
Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald
Rational Sumchecks. TCC (A2) (2016)
Pavel Hubácek, Eylon Yogev
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. Electron. Colloquium Comput. Complex. 23 (2016)
Pavel Hubácek, Moni Naor, Eylon Yogev
The Journey from NP to TFNP Hardness. Electron. Colloquium Comput. Complex. 23 (2016)
Pavel Hubácek, Moni Naor, Jonathan R. Ullman
When Can Limited Randomness Be Used in Repeated Games? Theory Comput. Syst. 59 (4) (2016)
Pavel Hubácek, Moni Naor, Jonathan R. Ullman
When Can Limited Randomness Be Used in Repeated Games? SAGT (2015)
Pavel Hubácek, Moni Naor, Jonathan R. Ullman
When Can Limited Randomness Be Used in Repeated Games? CoRR (2015)
Pavel Hubácek, Daniel Wichs
On the Communication Complexity of Secure Function Evaluation with Long Output. ITCS (2015)
Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald
Rational Sumchecks. IACR Cryptol. ePrint Arch. 2015 (2015)
Pavel Hubácek, Sunoo Park
Cryptographically Blinded Games: Leveraging Players' Limitations for Equilibria and Profit. CoRR (2014)
Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald
Rational arguments: single round delegation with sublinear verification. ITCS (2014)
Pavel Hubácek, Sunoo Park
Cryptographically blinded games: leveraging players' limitations for equilibria and profit. EC (2014)
Pavel Hubácek, Daniel Wichs
On the Communication Complexity of Secure Function Evaluation with Long Output. IACR Cryptol. ePrint Arch. 2014 (2014)
Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen
Limits on the Power of Cryptographic Cheap Talk. CRYPTO (1) (2013)
Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen
Limits on the Power of Cryptographic Cheap Talk. IACR Cryptol. ePrint Arch. 2013 (2013)