Benjamin Harsha

Publication Activity (10 Years)

Years Active: 2017-2021
Publications (10 Years): 13

Top Topics

Video Copy Detection

Graphical Password

Hashing Algorithm

Top Venues

IACR Cryptol. ePrint Arch.

IEEE Symposium on Security and Privacy

Publications

Benjamin Harsha, Robert Morton, Jeremiah Blocki, John A. Springer, Melissa Dark
Bicycle attacks considered harmful: Quantifying the damage of widespread password length leakage. Comput. Secur. 100 (2021)
Wenjie Bai, Jeremiah Blocki, Benjamin Harsha
Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking. GameSec (2021)
Jeremiah Blocki, Benjamin Harsha, Samson Zhou
On the Economics of Offline Password Cracking. CoRR (2020)
Wenjie Bai, Jeremiah Blocki, Benjamin Harsha
Information Signaling: A Counter-Intuitive Defense Against Password Cracking. CoRR (2020)
Benjamin Harsha, Jeremiah Blocki
An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers. CoRR (2020)
Benjamin Harsha, Robert Morton, Jeremiah Blocki, John A. Springer, Melissa Dark
Bicycle Attacks Considered Harmful: Quantifying the Damage of Widespread Password Length Leakage. CoRR (2020)
Jeremiah Blocki, Benjamin Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, Samson Zhou
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. CRYPTO (2) (2019)
Benjamin Harsha, Jeremiah Blocki
Just In Time Hashing. EuroS&P (2018)
Jeremiah Blocki, Benjamin Harsha, Samson Zhou
On the Economics of Offline Password Cracking. IEEE Symposium on Security and Privacy (2018)
Jeremiah Blocki, Benjamin Harsha, Siteng Kang, Seunghoon Lee, Lu Xing, Samson Zhou
Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. IACR Cryptol. ePrint Arch. 2018 (2018)
Benjamin Harsha, Jeremiah Blocki
Just in Time Hashing. IACR Cryptol. ePrint Arch. 2018 (2018)
Joël Alwen, Jeremiah Blocki, Benjamin Harsha
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2017 (2017)
Joël Alwen, Jeremiah Blocki, Benjamin Harsha
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. CCS (2017)