About

I am a member of the Department of Mathematical Logic and Theoretical Computer Science at the Institute of Mathematics of the Czech Academy of Sciences.

I am also a member of the Computer Science Institute of Charles University at the Faculty of Mathematics and Physics.

My research is in theoretical computer science with a focus on problems at the intersection of cryptography, computational complexity, and game theory.

Interests
  • Theoretical Computer Science
  • Cryptography
  • Computational Complexity
Education
  • PhD in Computer Science - Cryptography, 2014

    Aarhus University, Denmark

Recent Publications

DBLP

(2021). On Search Complexity of Discrete Logarithm. 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia.

PDF Cite DOI

(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.

PDF Cite DOI

(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.

PDF Cite DOI

Seminars and Teaching

Join our Seminar on Theory of Computing (Seminář z teoretické informatiky)! 👩‍🏫🍕👨‍🏫

During the fall term of 2023, I am teaching the following course at Charles University:

Students

I am always looking for motivated students of all levels interested in cryptography and computer security or computational complexity. Contact me via email to discuss possible topics for a research project.

I had the chance to work with and supervise exceptional students in the past:

PhD

Master

Bachelor

Contact

  • hubacek@iuuk.mff.cuni.cz
  • Institute of Mathematics of the Czech Academy of Sciences, Žitná 25, Praha 1, 115 67
  • Office 523 – back building, 2nd floor