Pavel Hubáček
Pavel Hubáček
Czech Academy of Sciences and Charles University
Verified email at - Homepage
Cited by
Cited by
On the communication complexity of secure function evaluation with long output
P Hubacek, D Wichs
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
Tortoise and hares consensus: the meshcash framework for incentive-compatible, scalable cryptocurrencies
I Bentov, P Hubáček, T Moran, A Nadler
Cyber Security Cryptography and Machine Learning: 5th International …, 2021
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
P Hubáček, E Yogev
Electronic Colloquium on Computational Complexity (ECCC) 23, 63, 2016
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
AR Choudhuri, P Hubáček, C Kamath, K Pietrzak, A Rosen, GN Rothblum
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
Rational arguments: single round delegation with sublinear verification
S Guo, P Hubáček, A Rosen, M Vald
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
The Journey from NP to TFNP Hardness
P Hubáček, M Naor, E Yogev
Electronic Colloquium on Computational Complexity (ECCC) 23, 199, 2016
PPAD-hardness via iterated squaring modulo a composite
AR Choudhuri, P Hubácek, C Kamath, K Pietrzak, A Rosen, GN Rothblum
Cryptology ePrint Archive, 2019
Rational sumchecks
S Guo, P Hubáček, A Rosen, M Vald
Theory of Cryptography Conference, 319-351, 2015
ARRIVAL: next stop in CLS
B Gärtner, TD Hansen, P Hubáček, K Král, H Mosaad, V Slívová
arXiv preprint arXiv:1802.07702, 2018
Must the communication graph of MPC protocols be an expander?
E Boyle, R Cohen, D Data, P Hubáček
Journal of Cryptology 36 (3), 20, 2023
Stronger lower bounds for online ORAM
P Hubáček, M Koucký, K Král, V Slívová
Theory of Cryptography Conference, 264-284, 2019
Practical statistically-sound proofs of exponentiation in any group
C Hoffmann, P Hubáček, C Kamath, K Klein, K Pietrzak
Annual International Cryptology Conference, 370-399, 2022
Limits on the power of cryptographic cheap talk
P Hubáček, JB Nielsen, A Rosen
Annual Cryptology Conference, 277-297, 2013
On search complexity of discrete logarithm
P Hubáček, J Václavek
arXiv preprint arXiv:2107.02617, 2021
An efficiency-preserving transformation from honest-verifier statistical zero-knowledge to statistical zero-knowledge
P Hubáček, A Rosen, M Vald
Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018
Certifying giant nonprimes
C Hoffmann, P Hubáček, C Kamath, K Pietrzak
IACR International Conference on Public-Key Cryptography, 530-553, 2023
On Average-Case Hardness in from One-Way Functions
P Hubáček, C Kamath, K Král, V Slívová
Theory of Cryptography Conference, 614-638, 2020
When can limited randomness be used in repeated games?
P Hubáček, M Naor, J Ullman
Theory of Computing Systems 59 (4), 722-746, 2016
TFNP Intersections Through the Lens of Feasible Disjunction
P Hubáček, E Khaniki, N Thapen
15th Innovations in Theoretical Computer Science Conference (ITCS 2024), 2024
PPP-Completeness and Extremal Combinatorics
R Bourneuf, L Folwarczný, P Hubáček, A Rosen, NI Schwartzbach
arXiv preprint arXiv:2209.04827, 2022
The system can't perform the operation now. Try again later.
Articles 1–20