Dima Kogan

dkogan@cs.stanford.edu

I recently graduated with a PhD in computer science from Stanford University, where I was fortunate to be advised by by Dan Boneh. 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.

Publications

Single-Server Private Information Retrieval with Sublinear Amortized Time. Henry Corrigan-Gibbs, Alexandra Henzinger, Dmitry Kogan. Eurocrypt 2022.

Private Blocklist Lookups with Checklist. Dmitry Kogan, Henry Corrigan-Gibbs. USENIX Security 2021.

Oblivious Pseudorandom Functions from Isogenies. Dan Boneh, Dmitry Kogan, Katharine Woo. Asiacrypt 2020.

Private Information Retrieval with Sublinear Online Time. Henry Corrigan-Gibbs, Dmitry Kogan. Eurocrypt 2020. Best Young Researcher Paper Award.

The Function-Inversion Problem: Barriers and Opportunities. Henry Corrigan-Gibbs, Dmitry Kogan. TCC 2019. Best Young Researcher Paper Award.

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. Isr. J. Math. (2016) 212: 139.

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