About Me
I am a PhD student at Boston University’s Department of Computer Science. I am interested in cryptography and intersecting topics from quantum computing, complexity theory, and number theory.
In June 2019, I graduated with a BSc summa cum laude from the American University in Cairo (AUC), Egypt where I studied mathematics and computer engineering. Previously, I interned with Microsoft Research, Affectiva, Twitter, EPFL, and IPAM at UCLA.
I organize a mailing list and reading group on post-quantum and quantum cryptography (pq2c) at BU (well, virtually!).
- Cryptography
- Quantum Computing
- Theoretical Computer Science
- Security and Privacy
-
PhD in Computer Science, In Progress
Boston University
-
BSc in Computer Engineering and Mathematics, 2019
The American University in Cairo
-
Visiting Project Student, 2018
EPFL
Research Summary
I am broadly interested in cryptography and its intersection with quantum computing and complexity theory. My current research studies questions such as:
- How can one party (non-)interactively prove statements to another untrusting party? [Proof Systems]
- How can we make sure such proofs reveal nothing else? [Zero-Knowledge Proofs]
- How can we make such proofs efficiently checkable? [Probabilistically Checkable Proofs (PCPs)]
- How can we reduce the communication between the prover and the verifier? [Succinct Arguments]
- How can parties compute joint functions without exposing their private inputs? [Secure Multiparty Computation (MPC)]
Previously, my undergraduate journey exposed me to other interesting research topics across different areas including number theory, machine learning, security, and privacy.
