Mohammad Hassan Ameri Ekhtiarabadi
Graduate Student
Graduate Teaching Assistant
Joined department: Spring 2019
I am a Ph.D. candidate in Computer Science at Purdue University, working under the supervision of Jeremiah Blocki. My research lies at the intersection of applied cryptography, privacy-preserving computation, and theoretical computer science. I am broadly interested in designing and analyzing cryptographic primitives and protocols that offer provable security guarantees while remaining efficient and practical. My work explores a range of foundational and applied topics including secure multi-party computation, memory-hard functions (MHFs), obfuscation, searchable encryption, and secure cloud computing. A recurring theme in my research is understanding how to formalize and protect privacy, usability, and computational fairness in real-world systems through rigorous mathematical proofs. Recent publications have advanced our understanding of conditional encryption for password typo correction, provably memory-hard puzzles and computationally data independent memory-hard functions—contributing to both the theoretical and practical aspects of modern cryptography.
Selected Publications
Conditional Encryption with Applications to Secure Personalized Password Typo Correction Mohammad Hassan Ameri, Jeremiah Blocki, ACM CCS 2024, [Link to Full Version].
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes, Mohammad Hassan Ameri, Alexander Block, Jeremiah Blocki, SCN 2022, [Full Version].
Cost-Asymmetric Memory Hard Password Hashing, Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri, SCN 2022, [Full Version].
Computationally Data-Independent Memory Hard Functions, Mohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou, ITCS 2020, [pdf].
A Key-Policy Attribute-Based Temporary Keyword Search scheme for Secure Cloud Storage, MH Ameri, M Delavar, J Mohajeri, M Salmasizadeh, "", IEEE Transactions on Cloud Computing, 2018.