Pavel Hubáček

Cited by

	All	Since 2018
Citations	553	456
h-index	11	11
i10-index	11	11

20142015201620172018201920202021202220239 9 31 39 46 72 89 80 88 80

Public access

View all

12 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Alon RosenBocconi UniversityVerified email at unibocconi.it
Chethan KamathPost-doctoral researcher, Tel Aviv UniversityVerified email at ist.ac.at
krzysztof pietrzakProfessor, Cryptography, IST AustriaVerified email at ist.ac.at
Siyao GUONYU ShanghaiVerified email at nyu.edu
Eylon YogevBar-Ilan UniversityVerified email at biu.ac.il
Asaf NadlerBen Gurion University of the NegevVerified email at post.bgu.ac.il
Guy RothblumWeizmann Institute of ScienceVerified email at alum.mit.edu
Arka Rai ChoudhuriPostdoctoral Researcher, UC BerkeleyVerified email at berkeley.edu
Daniel WichsNortheastern University, Associate ProfessorVerified email at ccs.neu.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Tal MoranIDC HerzliyaVerified email at idc.ac.il
Charlotte HoffmannInstitute of Science and Technology AustriaVerified email at ist.ac.at
Ran CohenReichman University (aka IDC Herzliya)Verified email at runi.ac.il
Deepesh DataMeta Platforms, Inc.Verified email at meta.com
Elette BoyleVerified email at mit.edu
Thomas Dueholm HansenFormer Associate professor, University of CopenhagenVerified email at di.ku.dk
Bernd GärtnerProfessor of Computer Science, ETH ZurichVerified email at inf.ethz.ch
Jesper Buus NielsenProfessor of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Lukáš FolwarcznýComputer Science Institute of Charles UniversityVerified email at iuuk.mff.cuni.cz
Sunoo ParkMITVerified email at csail.mit.edu

Pavel Hubáček

Czech Academy of Sciences and Charles University

Verified email at iuuk.mff.cuni.cz - Homepage

Cryptography Game Theory Computational Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	127	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	78*	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	76*	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	48	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	39	2014
The Journey from NP to TFNP Hardness P Hubáček, M Naor, E Yogev Electronic Colloquium on Computational Complexity (ECCC) 23, 199, 2016	35*	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	30	2019
Rational sumchecks S Guo, P Hubáček, A Rosen, M Vald Theory of Cryptography Conference, 319-351, 2015	27	2015
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	21	2023
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	19	2018
Stronger lower bounds for online ORAM P Hubáček, M Koucký, K Král, V Slívová Theory of Cryptography Conference, 264-284, 2019	17	2019
Limits on the power of cryptographic cheap talk P Hubáček, JB Nielsen, A Rosen Annual Cryptology Conference, 277-297, 2013	9	2013
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	8	2022
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	5	2018
On search complexity of discrete logarithm P Hubáček, J Václavek arXiv preprint arXiv:2107.02617, 2021	3	2021
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	3*	2020
Cryptographically blinded games: leveraging players' limitations for equilibria and profit P Hubáček, S Park Proceedings of the fifteenth ACM conference on Economics and computation …, 2014	3	2014
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	2	2016
Rationality in the Cryptographic Model P Hubáček Department Office Computer Science, Aarhus University, 2014	2	2014
PPP-Completeness and Extremal Combinatorics R Bourneuf, L Folwarczný, P Hubáček, A Rosen, NI Schwartzbach arXiv preprint arXiv:2209.04827, 2022	1	2022

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors