Hi! My Chinese name is 陈杉. I am a tenure-track associate professor at the Southern University of Science and Technology (SUSTech), Shenzhen 深圳, China. Before joining SUSTech in 2022, I earned my Ph.D. degree from Georgia Tech under the supervision of Alexandra (Sasha) Boldyreva and then worked as a postdoctoral researcher in the Cryptoplexity group led by Marc Fischlin. I started my cryptography research during my master’s studies, where I was fortunate to be advised by John Steinberger.
My research interests include cryptography and information security, with a current focus on real-world cryptography, as well as theoretical cryptography that shows strong potential for real-world applications. I am most passionate about analyzing deployed or soon-to-be-deployed security protocols and cryptographic primitives to develop provably secure and practically efficient cryptographic solutions.
I am seeking self-motivated students and postdocs for our Applied Cryptography Group.
If you are truly passionate about cryptography research, please feel free to contact me.
If your primary goal is simply to earn a graduate degree, please consider other fields — cryptography is demanding and requires genuine dedication.
* If you are curious about my advising style, this article about the Ph.D. experience may give you an idea, as I aim for a similar approach; a master’s experience is a simplified version of it, roughly aligning with the first phase of the Ph.D. journey.
PhD in Computer Science, 2020
Georgia Institute of Technology
MEng in Computer Science and Technology
Tsinghua University
BSc in Mathematics and Applied Mathematics
Beijing Normal University
* When all authors are theoretical cryptographers, their names are typically listed in alphabetical order by last name, following international convention.
* Rankings of good publication venues are always controversial, but the CORE rankings (for conferences and journals) are currently well recognized by international researchers.
Doctoral students:
Master students:
Visiting students:
CS216 Algorithm Design and Analysis (H) (Spring 2025, Spring 2024, Spring 2023)
CS201 Discrete Mathematics (Fall 2024, Fall 2023, Fall 2022)