default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenjamin Harsha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j1]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: 102068 (2021)- [c5]Wenjie Bai, Jeremiah Blocki, Benjamin Harsha:
Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking. GameSec 2021: 334-353 - 2020
- [i7]Benjamin Harsha, Robert Morton, Jeremiah Blocki, John A. Springer, Melissa Dark:
Bicycle Attacks Considered Harmful: Quantifying the Damage of Widespread Password Length Leakage. CoRR abs/2002.01513 (2020) - [i6]Benjamin Harsha, Jeremiah Blocki:
An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers. CoRR abs/2005.05911 (2020) - [i5]Jeremiah Blocki, Benjamin Harsha, Samson Zhou:
On the Economics of Offline Password Cracking. CoRR abs/2006.05023 (2020) - [i4]Wenjie Bai, Jeremiah Blocki, Benjamin Harsha:
Information Signaling: A Counter-Intuitive Defense Against Password Cracking. CoRR abs/2009.10060 (2020)
2010 – 2019
- 2019
- [c4]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: 573-607 - 2018
- [c3]Benjamin Harsha, Jeremiah Blocki:
Just In Time Hashing. EuroS&P 2018: 368-383 - [c2]Jeremiah Blocki, Benjamin Harsha, Samson Zhou:
On the Economics of Offline Password Cracking. IEEE Symposium on Security and Privacy 2018: 853-871 - [i3]Benjamin Harsha, Jeremiah Blocki:
Just in Time Hashing. IACR Cryptol. ePrint Arch. 2018: 112 (2018) - [i2]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: 944 (2018) - 2017
- [c1]Joël Alwen, Jeremiah Blocki, Benjamin Harsha:
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. CCS 2017: 1001-1017 - [i1]Joël Alwen, Jeremiah Blocki, Benjamin Harsha:
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2017: 443 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
