CV [pdf]
Education
- Ph.D. in Cryptography, COSIC, KU Leuven, Leuven, Belgium (2020-2024)
- M.S. in Secure Telecommunication and Cryptography, Sharif University of Technology, Tehran, Iran (2015-2017)
- B.S. in Electrical Engineering (Telecommunication), University of Birjand, Birjand, Iran (2010-2014)
Research Visits
I have had the chance to visit multiple research groups such as:
- Foundations of Cryptography Group, ETH Zurich, hosted by Prof. Dennis Hofheinz, 2024.
- Department of Information Engineering, Chinese University of Hong Kong (CUHK), hosted by Prof. Sherman S. M. Chow, 2023.
- ZK-Lab, University of Edinburgh, hosted by Prof. Markulf Kohlweiss, 2023.
- Computer Science Institute, Charles University in Prague, hosted by Prof. Pavel Hubáček, 2019.
Skills
- Python
- Rust
- Solidity
Open Source Projects
Unlinkable Policy-Compliant Signatures: Prototyping the PCS and several implementations for ul-PCS schemes. Link
Groth-Sahai Proofs: An efficient implementation for the seminal work of Jens Groth and Amit Sahai. Link
Nirvana Payment Python: A distributed implementation of an anonymous and reusable payment guarantee system. Link
Cross-Domain Attribute-Based Access Control Encryption (CD-ABACE): Proof of concept for the cross-domain access control encryption scheme. Link
Awards and Achievements
- The best proposal for the Virtual design challenge for authentication and protecting Full Motion Video system, University of British Columbia, Canada, 2019. Link
- Ranked 46th in M.Sc. national university entrance exam in Communications branch among about 20,000 participants, 2015.
- Ranked 36th in Iranian National Olympiad in Electrical Engineering among all bachelor students of Electrical Engineering, 2014.
Publications
A more updated list of my publications can be found in my Google Scholar and DBLP accounts.
Services
- I have served on the AC-2024, CANS-2024, CRYPTO-2024, PKC-2024, IEEE TDSC-2024, LatinCrypt-2023, ACM CCS-2023, IEEE TDSC-2023, IEEE TIFS-2022, EC-2022, AC-2020, TCC-2019, and ISCISC-2018 as reviewer.