Dima Kogan


I am a PhD student in computer science at Stanford University, advised by Dan Boneh and David Mazières.

I am broadly interested in computer security, systems, and applied cryptography.

Previously, I completed my MSc in computer science in the Weizmann Institute of Science under the supervision of Robert Krauthgamer. I hold a BSc in computer science, physics and mathematics from the Hebrew University of Jerusalem, where I graduated from the Talpiot program. I also worked for a few years as a software engineer and a team leader in government and industry, focusing on cyber security, identity management, and data analytics.


The Function-Inversion Problem: Barriers and Opportunities. Henry Corrigan-Gibbs, Dmitry Kogan.

The Discrete-Logarithm Problem with Preprocessing. Henry Corrigan-Gibbs, Dmitry Kogan. Eurocrypt 2018. Best Young Researcher Paper Award.

The Case For Secure Delegation. Dmitry Kogan, Henri Stern, Ashley Tolbert, David Mazières, Keith Winstein. HotNets 2017.

T/Key: Second-Factor Authentication From Secure Hash Chains. Dmitry Kogan, Nathan Manohar, Dan Boneh. CCS 2017.

An isoperimetric inequality for conjugation-invariant sets in the symmetric group. Neta Atzmon, David Ellis, Dmitry Kogan. Israel Journal of Mathematics 212 (2016), 139-162.

Sketching cuts in graphs and hypergraphs. Dmitry Kogan, Robert Krauthgamer. ITCS 2015.