About
I am a member of the Computer Science Institute of Charles University at the Faculty of Mathematics and Physics in Prague.
My research is in theoretical computer science, focusing on problems at the intersection of cryptography and computational complexity.
Interests
- Theoretical Computer Science
- Cryptography
- Computational Complexity
Education
-
PhD in Computer Science - Cryptography, 2014
Aarhus University, Denmark
Recent Publications
(2021).
On Search Complexity of Discrete Logarithm.
46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia.
(2021).
Tortoise and Hares Consensus: The Meshcash Framework for Incentive-Compatible, Scalable Cryptocurrencies.
Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Be’er Sheva, Israel, July 8-9, 2021, Proceedings.
(2020).
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.
SIAM J. Comput..
(2020).
On Average-Case Hardness in TFNP from One-Way Functions.
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part III.
Seminars and Teaching
Join our Seminar on Theory of Computing (Seminář z teoretické informatiky)! 👩🏫🍕👨🏫
During the winter term of 21/22, I am teaching the following courses:
Students
I had the chance to work with and supervise exceptional students:
PhD
- Veronika Slívová (2017 - 2021, → Google)
Master
- Jan Václavek (2021)
Bachelor
- Martin Pastyřík (2021, 2nd place in student competition KEYMAKER 2021)
- Petr Sedláček (2021, 3rd place in student research competition SVOČ 2021)
- Tomáš Krňák (2019)
Contact
- hubacek@iuuk.mff.cuni.cz
- Malostranské nám. 2/25, Praha 1, 118 00
- Office 326 (3rd floor - corridor opposite lecture room S3)