Pavel Hubácek

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