Jeremiah M. Blocki
Associate Professor of Computer Science
Joined department: Fall 2016
At a high level Professor Blocki describes himself as "a theoretical computer scientist who is interested in applying fundamental ideas from computer science to address practical problems in usable privacy and security." He is especially interested in developing usable authentication protocols for humans. Are there easy ways for humans to create and remember multiple strong passwords? Can we design secure cryptographic protocols that are so simple that can be run by a human? Jeremiah has also developed algorithms for conducting privacy preserving data analysis in several different application settings including social networks and password data. Prior to joining Purdue Jeremiah completed his PhD on Usable Human Authentication at Carnegie Mellon University under the supervision of his advisors Manuel Blum and Anupam Datta. He also spent a year at Microsoft Research New England as a postdoc.
Efficiently Computing Data Independent Memory Hard Functions. with Joel Alwen. CRYPTO 2016.
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. with Ben Harsha and Siteng Kang and Seunghoon Lee and Lu Xing and Samson Zhou. CRYPTO 2019
Bandwidth-Hard Functions: Reductions and Lower Bounds. with Ling Ren and Samson Zhou. CCS 2018
On the Economics of Offline Password Cracking. with Ben Harsha and Samson Zhou. 39th IEEE Symposium on Security & Privacy (S&P 2018).
Sustained Space Complexity. with Joel Alwen and Krzysztof Pietrzak. EUROCRYPT 2018