Pavel Hubácek

According to our database, Pavel Hubácek authored at least 27 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Foundations of Fiat-Denominated Loans Collateralized by Cryptocurrencies.

Pavel Hubácek, Jan Václavek, Michelle Yeo

CoRR, October, 2025

Practical Batch Proofs of Exponentiation.

Charlotte Hoffmann, Pavel Hubácek, Svetlana Ivanova

IACR Commun. Cryptol., 2025

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

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

TFNP Intersections Through the Lens of Feasible Disjunction.

Pavel Hubácek, Erfan Khaniki, Neil Thapen

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

One-Way Functions vs. TFNP: Simpler and Improved.

Lukás Folwarczný, Mika Göös, Pavel Hubácek, Gilbert Maystre, Weiqiang Yuan

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

2023

(Verifiable) Delay Functions from Lucas Sequences.

Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák

Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Certifying Giant Nonprimes.

Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak

Proceedings of the Public-Key Cryptography - PKC 2023, 2023

PPP-Completeness and Extremal Combinatorics.

Romain Bourneuf, Lukás Folwarczný, Pavel Hubácek, Alon Rosen, Nikolaj I. Schwartzbach

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

Practical Statistically-Sound Proofs of Exponentiation in Any Group.

Charlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

On the Distributed Discrete Logarithm Problem with Preprocessing.

Pavel Hubácek, L'ubica Jancová, Veronika Králová

Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021

On Search Complexity of Discrete Logarithm.

Pavel Hubácek, Jan Václavek

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies.

Iddo Bentov, Pavel Hubácek, Tal Moran, Asaf Nadler

Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

2020

On Average-Case Hardness in TFNP from One-Way Functions.

Pavel Hubácek, Chethan Kamath, Karel Král, Veronika Slívová

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

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

Stronger Lower Bounds for Online ORAM.

Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová

Proceedings of the Theory of Cryptography - 17th International Conference, 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

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

ARRIVAL: Next Stop in CLS.

Bernd Gärtner, Thomas Dueholm Hansen, Pavel Hubácek, Karel Král, Hagar Mosaad, Veronika Slívová

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge.

Pavel Hubácek, Alon Rosen, Margarita Vald

Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Must the Communication Graph of MPC Protocols be an Expander?

Elette Boyle, Ran Cohen, Deepesh Data, Pavel Hubácek

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017

Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.

Pavel Hubácek, Eylon Yogev

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

The Journey from NP to TFNP Hardness.

Pavel Hubácek, Moni Naor, Eylon Yogev

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Rational Sumchecks.

Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald

Proceedings of the Theory of Cryptography - 13th International Conference, 2016

2015

When Can Limited Randomness Be Used in Repeated Games?

Pavel Hubácek, Moni Naor, Jonathan R. Ullman

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

On the Communication Complexity of Secure Function Evaluation with Long Output.

Pavel Hubácek, Daniel Wichs

Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014

Cryptographically blinded games: leveraging players' limitations for equilibria and profit.

Pavel Hubácek, Sunoo Park

Proceedings of the ACM Conference on Economics and Computation, 2014

Rational arguments: single round delegation with sublinear verification.

Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald

Proceedings of the Innovations in Theoretical Computer Science, 2014

2013

Limits on the Power of Cryptographic Cheap Talk.

Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013