Muhammed F. Esgin

Lecturer, Faculty of Information Technology, Monash University


Faculty of Information Technology, Monash University

Clayton, VIC 3800, Australia

I am interested in mathematical aspects of cybersecurity, particularly around cryptography. My current research focuses are quantum-safe cryptography (particularly, from lattices and hash functions), privacy-enhancing technologies, zero-knowledge proofs and blockchain protocols as well as their real-life applications to establish various security features such as confidentiality, integrity, privacy, anonymity and accountability in practice. I have also worked on symmetric-key cryptography and classical public-key cryptography.

I currently work as a lecturer at the Faculty of Information Technology, Monash University. Before that, I was a post-doc at Monash and CSIRO’s Data61 jointly. I also did a research internship at IBM Research, Zurich, hosted by Vadim Lyubashevsky. I completed my PhD at Monash under the supervision of Ron Steinfeld, Joseph Liu and Dongxi Liu.

I organise Monash Software Systems and Cybersecurity (SSC) Seminars. If you are interested in cutting-edge research in cybersecurity, sofware engineering and data engineering, see our website for past and upcoming events.

I have multiple PhD scholarships available. Please refer to supervision.

This webpage is currently under development. If you spot any issues, please contact me via email (provided at the end of the page).

Program Committee Memberships


Nov 10, 2023 Our quantum-safe hybrid proof system, LANES+, and Verifiable Random Function (VRF), LaV, (appeared at Crypto’23) now have efficient open source implementations here.
May 24, 2023 “Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs” is accepted to appear at CRYPTO 2023 (CORE rank: A*)! See the full paper here
Apr 24, 2023 Our new blockchain leader election work supporting post-quantum security is accepted at AsiaCCS 2023 (CORE rank: A). You can read it here.
Apr 1, 2023 I gave a talk on lattice-based zero-knowledge proofs (starting from the basics) and MatRiCT family of Monero-style post-quantum blockchain payment protocols. You can watch it here.
Oct 27, 2022 Our survey on post-quantum advanced signatures for blockchain is accepted at ACM Computing Surveys (IF: 14.32)! See the paper here

selected publications

  1. BlindHub: Bitcoin-Compatible Privacy-Preserving Payment Channel Hubs Supporting Variable Amounts
    Xianrui Qin, Shimin Pan, Arash Mirzaei, Zhimei Sui, Oğuzhan ErsoyAmin SakzadMuhammed F. EsginJoseph K. Liu, Jiangshan Yu, and Tsz Hon Yuen
    In IEEE Symposium on Security and Privacy (S&P), 2023
  2. Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs
    Muhammed F. EsginRon SteinfeldDongxi Liu, and Sushmita Ruj
    In CRYPTO, 2023
  3. Private Re-Randomization for Module LWE and Applications to Quasi-Optimal ZK-SNARKs
    Ron SteinfeldAmin SakzadMuhammed F. Esgin, and Veronika Kuchta
  4. A New Look at Blockchain Leader Election: Simple, Efficient, Sustainable and Post-Quantum
    Muhammed F. EsginOguzhan Ersoy, Veronika Kuchta, Julian Loss, Amin SakzadRon Steinfeld, Wayne Yang, and Raymond K. Zhao
    In ACM Asia Conference on Computer and Communications Security (ACM AsiaCCS), 2023
  5. A Survey on Exotic Signatures for Post-Quantum Blockchain: Challenges & Research Directions
    Maxime Buser, Rafael Dowsley, Muhammed F. Esgin, Clémentine Gritti, Shabnam Kasra Kermanshahi, Veronika Kuchta, Jason T. LeGrow, Joseph K. Liu, Raphael C.-W. Phan, Amin SakzadRon Steinfeld, and Jiangshan Yu
    ACM Computing Surveys, 2022