Jeremiah Blocki

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 98

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

ISIT

ITCS

Publications

Jeremiah Blocki, Blake Holman, Seunghoon Lee
The Impact of Reversibility on Parallel Pebbling. IACR Cryptol. ePrint Arch. 2024 (2024)
Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri
Cost-asymmetric memory hard password hashing. Inf. Comput. 297 (2024)
Jeremiah Blocki, Peiyuan Liu, Ling Ren, Samson Zhou
Bandwidth-Hard Functions: Reductions and Lower Bounds. J. Cryptol. 37 (2) (2024)
Jeremiah Blocki, Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee
Differential privacy and Sublinear time are incompatible sometimes. CoRR (2024)
Jeremiah Blocki, Peiyuan Liu
Towards a Rigorous Statistical Analysis of Empirical Password Datasets. SP (2023)
Alexander R. Block, Jeremiah Blocki
Computationally Relaxed Locally Decodable Codes, Revisited. ISIT (2023)
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. APPROX/RANDOM (2023)
Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CCC (2023)
Jeremiah Blocki, Seunghoon Lee, Tamalika Mukherjee, Samson Zhou
Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model. ICLR (2023)
Peiyuan Liu, Jeremiah Blocki, Wenjie Bai
Confident Monte Carlo: Rigorous Analysis of Guessing Curves for Probabilistic Password Models. SP (2023)
Jeremiah Blocki, Seunghoon Lee, Tamalika Mukherjee, Samson Zhou
-Heavy Hitters in the Sliding Window Model. CoRR (2023)
Alexander R. Block, Jeremiah Blocki
Computationally Relaxed Locally Decodable Codes, Revisited. CoRR (2023)
Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS (2022)
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
Privately Estimating Graph Parameters in Sublinear time. CoRR (2022)
Jeremiah Blocki, Wuwei Zhang
DALock: Password Distribution-Aware Throttling. Proc. Priv. Enhancing Technol. 2022 (3) (2022)
Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri
Cost-Asymmetric Memory Hard Password Hashing. CoRR (2022)
Jeremiah Blocki, Seunghoon Lee
On the Multi-user Security of Short Schnorr Signatures with Preprocessing. EUROCRYPT (2) (2022)
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee, Samson Zhou
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. CoRR (2022)
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
Privately Estimating Graph Parameters in Sublinear Time. ICALP (2022)
Jeremiah Blocki, Blake Holman, Seunghoon Lee
The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs. IACR Cryptol. ePrint Arch. 2022 (2022)
Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. CoRR (2022)
Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, Jin Young Son
On Explicit Constructions of Extremely Depth Robust Graphs. STACS (2022)
Aiping Xiong, Chuhao Wu, Tianhao Wang, Robert W. Proctor, Jeremiah Blocki, Ninghui Li, Somesh Jha
Using Illustrations to Communicate Differential Privacy Trust Models: An Investigation of Users' Comprehension, Perception, and Data Sharing Decision. CoRR (2022)
Jeremiah Blocki, Blake Holman
Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions. CRYPTO (3) (2022)
Wenjie Bai, Jeremiah Blocki, Mohammad Hassan Ameri
Cost-Asymmetric Memory Hard Password Hashing. SCN (2022)
Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. SCN (2022)
Jeremiah Blocki, Blake Holman
Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2022 (2022)
Jeremiah Blocki, Blake Holman, Seunghoon Lee
The Parallel Reversible Pebbling Game: Analyzing the Post-quantum Security of iMHFs. TCC (1) (2022)
Wenjie Bai, Jeremiah Blocki
DAHash: Distribution Aware Tuning of Password Hashing Costs. CoRR (2021)
Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee, Jin Young Son
On Explicit Constructions of Extremely Depth Robust Graphs. CoRR (2021)
Mohammad Hassan Ameri, Alexander R. Block, Jeremiah Blocki
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. IACR Cryptol. ePrint Arch. 2021 (2021)
Jeremiah Blocki, Peiyuan Liu
Towards a Rigorous Statistical Analysis of Empirical Password Datasets. CoRR (2021)
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)
Alexander R. Block, Jeremiah Blocki
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. ISIT (2021)
Wenjie Bai, Jeremiah Blocki
DAHash: Distribution Aware Tuning of Password Hashing Costs. Financial Cryptography (2) (2021)
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
Differentially-Private Sublinear-Time Clustering. ISIT (2021)
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Relaxed Locally Correctable Codes in Computationally Bounded Channels. IEEE Trans. Inf. Theory 67 (7) (2021)
Alexander R. Block, Jeremiah Blocki
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. CoRR (2021)
Jeremiah Blocki, Mike Cinkoske
A New Connection Between Node and Edge Depth Robust Graphs. ITCS (2021)
Jeremiah Blocki, Seunghoon Lee
Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs. CoRR (2021)
Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. CoRR (2021)
Jeremiah Blocki, Seunghoon Lee, Samson Zhou
On the Security of Proofs of Sequential Work in a Post-Quantum World. ITC (2021)
Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Nouraldin Jaber, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni
HACCLE: metaprogramming for secure multi-party computation. GPCE (2021)
Wenjie Bai, Jeremiah Blocki, Benjamin Harsha
Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking. GameSec (2021)
Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. FOCS (2021)
Jeremiah Blocki, Elena Grigorescu, Tamalika Mukherjee
Differentially-Private Sublinear-Time Clustering. CoRR (2021)
Jeremiah Blocki, Benjamin Harsha, Samson Zhou
On the Economics of Offline Password Cracking. CoRR (2020)
Jeremiah Blocki, Seunghoon Lee, Samson Zhou
On the Security of Proofs of Sequential Work in a Post-Quantum World. CoRR (2020)
Jeremiah Blocki, Wuwei Zhang
DALock: Distribution Aware Password Throttling. CoRR (2020)
Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou
On Locally Decodable Codes in Resource Bounded Channels. ITC (2020)
Mohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou
Computationally Data-Independent Memory Hard Functions. ITCS (2020)
Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu
Locally Decodable/Correctable Codes for Insertions and Deletions. FSTTCS (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)
Jeremiah Blocki, Seunghoon Lee, Samson Zhou
Approximating Cumulative Pebbling Cost Is Unique Games Hard. ITCS (2020)
Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu
Locally Decodable/Correctable Codes for Insertions and Deletions. 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)
Yuyan Bao, Kirshanthan Sundararajah, Raghav Malik, Qianchuan Ye, Christopher Wagner, Fei Wang, Mohammad Hassan Ameri, Donghang Lu, Alexander Seto, Benjamin Delaware, Roopsha Samanta, Aniket Kate, Christina Garman, Jeremiah Blocki, Pierre-David Letourneau, Benoît Meister, Jonathan Springer, Tiark Rompf, Milind Kulkarni
HACCLE: An Ecosystem for Building Secure Multi-Party Computations. CoRR (2020)
Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou
On Locally Decodable Codes in Resource Bounded Channels. CoRR (2019)
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)
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Relaxed Locally Correctable Codes in Computationally Bounded Channels. ISIT (2019)
Jeremiah Blocki, Seunghoon Lee, Samson Zhou
Approximating Cumulative Pebbling Cost is Unique Games Hard. CoRR (2019)
Mohammad Hassan Ameri, Jeremiah Blocki, Samson Zhou
Computationally Data-Independent Memory Hard Functions. CoRR (2019)
Jeremiah Blocki, Mike Cinkoske
A New Connection Between Node and Edge Depth Robust Graphs. CoRR (2019)
Jeremiah Blocki, Seunghoon Lee
On the Multi-User Security of Short Schnorr Signatures. IACR Cryptol. ePrint Arch. 2019 (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, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Relaxed Locally Correctable Codes in Computationally Bounded Channels. CoRR (2018)
Jeremiah Blocki, Ling Ren, Samson Zhou
Bandwidth-Hard Functions: Reductions and Lower Bounds. CCS (2018)
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu, Samson Zhou
Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. ICALP (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)
Jeremiah Blocki, Ling Ren, Samson Zhou
Bandwidth-Hard Functions: Reductions and Lower Bounds. IACR Cryptol. ePrint Arch. 2018 (2018)
Benjamin Harsha, Jeremiah Blocki
Just in Time Hashing. IACR Cryptol. ePrint Arch. 2018 (2018)
Jeremiah Blocki, Samson Zhou
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. Financial Cryptography (2018)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Sustained Space Complexity. EUROCRYPT (2) (2018)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Sustained Space Complexity. IACR Cryptol. ePrint Arch. 2018 (2018)
Jeremiah Blocki, Manuel Blum, Anupam Datta, Santosh S. Vempala
Towards Human Computable Passwords. ITCS (2017)
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, Krzysztof Pietrzak
Depth-Robust Graphs and Their Cumulative Memory Complexity. EUROCRYPT (3) (2017)
Joël Alwen, Jeremiah Blocki, Benjamin Harsha
Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. CCS (2017)
Joël Alwen, Jeremiah Blocki
Towards Practical Attacks on Argon2i and Balloon Hashing. EuroS&P (2017)
Tianhao Wang, Jeremiah Blocki, Ninghui Li, Somesh Jha
Locally Differentially Private Protocols for Frequency Estimation. USENIX Security Symposium (2017)
Tianhao Wang, Jeremiah Blocki, Ninghui Li, Somesh Jha
Optimizing Locally Differentially Private Protocols. CoRR (2017)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Sustained Space Complexity. CoRR (2017)
Jeremiah Blocki, Samson Zhou
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. TCC (1) (2017)
Jeremiah Blocki, Samson Zhou
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. IACR Cryptol. ePrint Arch. 2017 (2017)
Jeremiah Blocki, Anupam Datta, Joseph Bonneau
Differentially Private Password Frequency Lists. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Jeremiah Blocki
Efficiently Computing Data-Independent Memory-Hard Functions. CRYPTO (2) (2016)
Jeremiah Blocki, Samson Zhou
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. CoRR (2016)
Jeremiah Blocki, Anupam Datta
CASH: A Cost Asymmetric Secure Hash Algorithm for Optimal Password Protection. CSF (2016)
Joël Alwen, Jeremiah Blocki
Efficiently Computing Data-Independent Memory-Hard Functions. IACR Cryptol. ePrint Arch. 2016 (2016)
Jeremiah Blocki, Anirudh Sridhar
Client-CASH: Protecting Master Passwords against Offline Attacks. CoRR (2016)
Jeremiah Blocki, Hong-Sheng Zhou
Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond. TCC (B2) (2016)
Jeremiah Blocki, Anupam Datta, Joseph Bonneau
Differentially Private Password Frequency Lists. NDSS (2016)
Jeremiah Blocki, Hong-Sheng Zhou
Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Jeremiah Blocki
Towards Practical Attacks on Argon2i and Balloon Hashing. IACR Cryptol. ePrint Arch. 2016 (2016)
Joël Alwen, Jeremiah Blocki, Krzysztof Pietrzak
Depth-Robust Graphs and Their Cumulative Memory Complexity. IACR Cryptol. ePrint Arch. 2016 (2016)
Jeremiah Blocki, Anirudh Sridhar
Client-CASH: Protecting Master Passwords against Offline Attacks. AsiaCCS (2016)
Jeremiah Blocki, Manuel Blum, Anupam Datta
Naturally Rehearsing Passwords. IACR Cryptol. ePrint Arch. 2015 (2015)
Jeremiah Blocki, Saranga Komanduri, Lorrie Faith Cranor, Anupam Datta
Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords. NDSS (2015)

Jeremiah Blocki.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Jeremiah Blocki