Mohammad Hassan Ameri

    Position: Ph.D. Student (Graduate Research/Teaching Assistant)
    Department: Computer Science
    Affiliation: Purdue University
    Email (academic): mameriek at Purdue.edu
    Gmail: m.hassan.ameri at gmail.com
    Office: LWSN 2161, #12, West Lafayette, IN
 some text

 

Short Bio

    I am a Computer Science PhD candidate at Purdue University specializing in Computer Security and Cryptography, advised by Professor Jeremiah Blocki. My research focuses on privacy-preserving systems, cryptographic protocols, secure systems, and the theoretical foundations of computer security. My research interests include applied cryptography, Conditional Encryption, memory-hard functions, cryptocurrency and blockchain security, obfuscation, secure cloud computing, searchable encryption, and provable security. More broadly, I am interested in the design and analysis of trustworthy computing systems, especially systems that require strong privacy and security guarantees under rigorous adversarial models. My work combines formal modeling, security analysis, technical writing, and research communication. I am especially interested in questions at the intersection of cryptography, privacy, security protocols, and real-world systems, including both foundational research and applied security problems. I am also interested in the practical implementation and evaluation of secure cryptographic algorithms for real-world applications.
Seeking Postdoctoral and Industry Research Positions

I am seeking postdoctoral opportunities and research positions in industry, starting in Spring 2027. My research interests include cryptography, privacy, and secure authentication, spanning theoretical foundations and practical applications. Please contact me to discuss potential opportunities.

Selected Publications

  1. Random Robust Secret Sharing with Perfect Privacy and Its Applications
    Mohammad Hassan Ameri and Jeremiah Blocki.
    in ACM CCS-2026. [Full version] [Code] [Porject Page] [Slides]
  2. Conditional Encryption with Applications to Secure Personalized Password Typo Correction
    Mohammad Hassan Ameri and Jeremiah Blocki.
    in ACM CCS 2024. [Project page] [Slides] [Full version] [Code]
  3. Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
    Mohammad Hassan Ameri, Alexander Block, and Jeremiah Blocki.
    in SCN 2022. [Full version]
  4. Cost-Asymmetric Memory-Hard Password Hashing
    Wenjie Bai, Jeremiah Blocki, and Mohammad Hassan Ameri.
    in SCN 2022. [Full version]
  5. Computationally Data-Independent Memory-Hard Functions
    Mohammad Hassan Ameri, Jeremiah Blocki, and Samson Zhou.
    in ITCS 2020. [Paper]
  6. HACCLE: Metaprogramming for Secure Multi-Party Computation
    Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Pierre-David Letourneau, Benoit Meister, Jonathan Springer, Tiark Rompf, and Milind Kulkarni.
    in ACM SIGPLAN GPCE 2021. [Paper]

For the complete list, see Google Scholar and DBLP.

Selected Talks & Presentations

Seminar & Conference Talks

  • Upcoming Conference Talk, ACM CCS 2026, The Hague, The Netherlands, November 18, 2026.
    Random Robust Secret Sharing with Perfect Privacy and its Applications
  • Invited Seminar Talk, SPRAI Seminar, University of Illinois Urbana-Champaign, September 2026.
    Random Robust Secret Sharing with Perfect Privacy and its Applications
  • Symposium Talk, Purdue Computer Science Graduate Research Symposium, Purdue University, March 2025.
    Conditional Encryption with Applications to Secure Personalized Password Typo Correction
  • Conference Talk, ACM CCS 2024, Salt Lake City, Utah, 2024.
    Conditional Encryption with Applications to Secure Personalized Password Typo Correction
  • Reading Group Talk, Purdue Theory Reading Group, Purdue University, April 21, 2022.
    Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes

Lightning & Rump Session Talks

  • Lightning Talk, 11th Midwest Security Workshop, University of Wisconsin–Madison, October 10, 2026.
    From Memory-Hardness to Password Authentication: Cryptographic Tools for Usable Security
  • Rump Session Talk, CRYPTO 2026, Santa Barbara, California, August 2026.
    Random Robust Secret Sharing with Perfect Privacy — Application: Practical UC-Secure fPAKE
  • Lightning Talk, Midwest Crypto Day, University of Illinois Urbana-Champaign, April 10, 2023.
    Conditional Encryption with Applications to Password Typo Correction
  • Rump Session Talk, CRYPTO 2022, Santa Barbara, California, August 2022.
    Conditional Encryption with Applications to Password Typo Correction

Professional Activities:

  • Invited Program Committee Member, ACM CCS 2027 --- Privacy & Anonymity Track
  • Conference External Reviewer:
    • Annual International Cryptology Conference (CRYPTO): [2020], [2021].
    • IEEE Symposium on Security and Privacy (IEEE S&P): [2020], [2022], [2023], [2024], [2025], [2026].
    • ACM Conference on Computer and Communications Security (ACM CCS): [2019].
    • Theory of Cryptography Conference (TCC): [2026].
    • Network and Distributed System Security Symposium (NDSS): [2020], [2021].
    • Financial Cryptography (FC): [2022].
    • Cryptographers' Track at the RSA Conference (RSA-CT): [2020].
  • Journal Reviewer of: IEEE Transactions on Information Forensics and Security (TIFS), IEEE Transactions on Dependable and Secure Computing (TDSC), IEEE Transactions on Emerging Topics in Computing (TETC), IEEE Communications Letters, and International Journal of Communication Systems (IJCS).

Teaching Experiences: