Resolving the Complexity of Some Data Privacy Problems. - Jeremiah Blocki; Ryan Williams 001 (ICALP (2), 2010)

Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection. - Jeremiah Blocki; Nicolas Christin; Anupam Datta; Arunesh Sinha (CSF, 2011)

Understanding and Protecting Privacy: Formal Semantics and Principled Audit Mechanisms. - Anupam Datta; Jeremiah Blocki; Nicolas Christin; Henry DeYoung; Deepak Garg 001; Limin Jia 001; Dilsun Kirli Kaynar; Arunesh Sinha (ICISS, 2011)

Audit Mechanisms for Privacy Protection in Healthcare Environments. - Jeremiah Blocki; Nicolas Christin; Anupam Datta; Arunesh Sinha (HealthSec, 2011)

Take Two Software Updates and See Me in the Morning: The Case for Software Security Evaluations of Medical Devices. - Steve Hanna; Rolf Rolles; Andres Molina-Markham; Pongsin Poosankam; Jeremiah Blocki; Kevin Fu; Dawn Song (HealthSec, 2011)

The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy. - Jeremiah Blocki; Avrim Blum; Anupam Datta; Or Sheffet (FOCS, 2012)

Audit Mechanisms for Provable Risk Management and Accountable Data Governance. - Jeremiah Blocki; Nicolas Christin; Anupam Datta; Arunesh Sinha (GameSec, 2012)

GOTCHA password hackers! - Jeremiah Blocki; Manuel Blum 001; Anupam Datta (AISec, 2013)

Adaptive Regret Minimization in Bounded-Memory Games. - Jeremiah Blocki; Nicolas Christin; Anupam Datta; Arunesh Sinha (GameSec, 2013)

Audit Games. - Jeremiah Blocki; Nicolas Christin; Anupam Datta; Ariel D. Procaccia; Arunesh Sinha (IJCAI, 2013)

Differentially private data analysis of social networks via restricted sensitivity. - Jeremiah Blocki; Avrim Blum; Anupam Datta; Or Sheffet (ITCS, 2013)

Optimizing password composition policies. - Jeremiah Blocki; Saranga Komanduri; Ariel D. Procaccia; Or Sheffet (EC, 2013)

Set Families with Low Pairwise Intersection. - Calvin Beideman; Jeremiah Blocki (CoRR, 2014)

Human Computable Passwords. - Jeremiah Blocki; Manuel Blum 001; Anupam Datta (CoRR, 2014)

Audit Games with Multiple Defender Resources. - Jeremiah Blocki; Nicolas Christin; Anupam Datta; Ariel D. Procaccia; Arunesh Sinha (AAAI, 2015)

Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords. - Jeremiah Blocki; Saranga Komanduri; Lorrie Faith Cranor; Anupam Datta (NDSS, 2015)

Naturally Rehearsing Passwords. - Jeremiah Blocki; Manuel Blum 001; Anupam Datta (IACR Cryptol. ePrint Arch., 2015)

Client-CASH: Protecting Master Passwords against Offline Attacks. - Jeremiah Blocki; Anirudh Sridhar (AsiaCCS, 2016)

CASH: A Cost Asymmetric Secure Hash Algorithm for Optimal Password Protection. - Jeremiah Blocki; Anupam Datta (CSF, 2016)

Efficiently Computing Data-Independent Memory-Hard Functions. - Joël Alwen; Jeremiah Blocki (IACR Cryptol. ePrint Arch., 2016)

Towards Practical Attacks on Argon2i and Balloon Hashing. - Joël Alwen; Jeremiah Blocki (IACR Cryptol. ePrint Arch., 2016)

Depth-Robust Graphs and Their Cumulative Memory Complexity. - Joël Alwen; Jeremiah Blocki; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2016)

Differentially Private Password Frequency Lists. - Jeremiah Blocki; Anupam Datta; Joseph Bonneau (IACR Cryptol. ePrint Arch., 2016)

Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond. - Jeremiah Blocki; Hong-Sheng Zhou (IACR Cryptol. ePrint Arch., 2016)

Towards Human Computable Passwords. - Jeremiah Blocki; Manuel Blum 001; Anupam Datta; Santosh S. Vempala (ITCS, 2017)

Locally Differentially Private Protocols for Frequency Estimation. - Tianhao Wang 001; Jeremiah Blocki; Ninghui Li; Somesh Jha (USENIX Security Symposium, 2017)

Optimizing Locally Differentially Private Protocols. - Tianhao Wang 001; Jeremiah Blocki; Ninghui Li; Somesh Jha (CoRR, 2017)

Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions. - Joël Alwen; Jeremiah Blocki; Benjamin Harsha (IACR Cryptol. ePrint Arch., 2017)

On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. - Jeremiah Blocki; Samson Zhou (IACR Cryptol. ePrint Arch., 2017)

On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling. - Jeremiah Blocki; Samson Zhou (Financial Cryptography, 2018)

Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels. - Jeremiah Blocki; Venkata Gandikota; Elena Grigorescu; Samson Zhou (ICALP, 2018)

On the Economics of Offline Password Cracking. - Jeremiah Blocki; Benjamin Harsha; Samson Zhou (IEEE Symposium on Security and Privacy, 2018)

Sustained Space Complexity. - Joël Alwen; Jeremiah Blocki; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2018)

Bandwidth-Hard Functions: Reductions and Lower Bounds. - Jeremiah Blocki; Ling Ren 001; Samson Zhou (IACR Cryptol. ePrint Arch., 2018)

Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions. - Jeremiah Blocki; Benjamin Harsha; Siteng Kang; Seunghoon Lee 004; Lu Xing; Samson Zhou (IACR Cryptol. ePrint Arch., 2018)

Just in Time Hashing. - Benjamin Harsha; Jeremiah Blocki (IACR Cryptol. ePrint Arch., 2018)

On the Multi-User Security of Short Schnorr Signatures. - Jeremiah Blocki; Seunghoon Lee 004 (IACR Cryptol. ePrint Arch., 2019)

Locally Decodable/Correctable Codes for Insertions and Deletions. - Alexander R. Block; Jeremiah Blocki; Elena Grigorescu; Shubhang Kulkarni; Minshen Zhu (FSTTCS, 2020)

On Locally Decodable Codes in Resource Bounded Channels. - Jeremiah Blocki; Shubhang Kulkarni; Samson Zhou (ITC, 2020)

Computationally Data-Independent Memory Hard Functions. - Mohammad Hassan Ameri; Jeremiah Blocki; Samson Zhou (ITCS, 2020)

Approximating Cumulative Pebbling Cost Is Unique Games Hard. - Jeremiah Blocki; Seunghoon Lee 004; Samson Zhou (ITCS, 2020)

An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers. - Benjamin Harsha; Jeremiah Blocki (CoRR, 2020)

DALock: Distribution Aware Password Throttling. - Jeremiah Blocki; Wuwei Zhang (CoRR, 2020)

HACCLE: An Ecosystem for Building Secure Multi-Party Computations. - Yuyan Bao; Kirshanthan Sundararajah; Raghav Malik; Qianchuan Ye; Christopher Wagner; Fei Wang 046; Mohammad Hassan Ameri; Donghang Lu; Alexander Seto; Benjamin Delaware; Roopsha Samanta; Aniket Kate; et al. (CoRR, 2020)

Information Signaling: A Counter-Intuitive Defense Against Password Cracking. - Wenjie Bai; Jeremiah Blocki; Benjamin Harsha (CoRR, 2020)

On the Security of Proofs of Sequential Work in a Post-Quantum World. - Jeremiah Blocki; Seunghoon Lee 004; Samson Zhou (ITC, 2021)

DAHash: Distribution Aware Tuning of Password Hashing Costs. - Wenjie Bai; Jeremiah Blocki (Financial Cryptography (2), 2021)

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions. - Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (FOCS, 2021)

Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking. - Wenjie Bai; Jeremiah Blocki; Benjamin Harsha (GameSec, 2021)

HACCLE: metaprogramming for secure multi-party computation. - Yuyan Bao; Kirshanthan Sundararajah; Raghav Malik; Qianchuan Ye; Christopher Wagner; Nouraldin Jaber; Fei Wang 046; Mohammad Hassan Ameri; Donghang Lu; Alexander Seto; Benjamin Delaware; Roopsha Samanta; et al. (GPCE, 2021)

A New Connection Between Node and Edge Depth Robust Graphs. - Jeremiah Blocki; Mike Cinkoske (ITCS, 2021)

Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. - Alexander R. Block; Jeremiah Blocki (ISIT, 2021)

Differentially-Private Sublinear-Time Clustering. - Jeremiah Blocki; Elena Grigorescu; Tamalika Mukherjee (ISIT, 2021)

Bicycle attacks considered harmful: Quantifying the damage of widespread password length leakage. - Benjamin Harsha; Robert Morton; Jeremiah Blocki; John A. Springer; Melissa Dark (Comput. Secur., 2021)

Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs. - Jeremiah Blocki; Seunghoon Lee 004 (CoRR, 2021)

Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. - Mohammad Hassan Ameri; Alexander R. Block; Jeremiah Blocki (IACR Cryptol. ePrint Arch., 2021)

Relaxed Locally Correctable Codes in Computationally Bounded Channels. - Jeremiah Blocki; Venkata Gandikota; Elena Grigorescu; Samson Zhou (IEEE Trans. Inf. Theory, 2021)

On the Multi-user Security of Short Schnorr Signatures with Preprocessing. - Jeremiah Blocki; Seunghoon Lee 004 (EUROCRYPT (2), 2022)

Privately Estimating Graph Parameters in Sublinear Time. - Jeremiah Blocki; Elena Grigorescu; Tamalika Mukherjee (ICALP, 2022)

On Explicit Constructions of Extremely Depth Robust Graphs. - Jeremiah Blocki; Mike Cinkoske; Seunghoon Lee 004; Jin Young Son (STACS, 2022)

Using Illustrations to Communicate Differential Privacy Trust Models: An Investigation of Users' Comprehension, Perception, and Data Sharing Decision. - Aiping Xiong; Chuhao Wu; Tianhao Wang 001; Robert W. Proctor; Jeremiah Blocki; Ninghui Li; Somesh Jha (CoRR, 2022)

Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions. - Jeremiah Blocki; Blake Holman (IACR Cryptol. ePrint Arch., 2022)

The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs. - Jeremiah Blocki; Blake Holman; Seunghoon Lee 004 (IACR Cryptol. ePrint Arch., 2022)

DALock: Password Distribution-Aware Throttling. - Jeremiah Blocki; Wuwei Zhang (Proc. Priv. Enhancing Technol., 2022)

How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. - Jeremiah Blocki; Elena Grigorescu; Tamalika Mukherjee; Samson Zhou (APPROX/RANDOM, 2023)

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. - Alexander R. Block; Jeremiah Blocki; Kuan Cheng; Elena Grigorescu; Xin Li 006; Yu Zheng 014; Minshen Zhu (CCC, 2023)

Differentially Private $L_2$-Heavy Hitters in the Sliding Window Model. - Jeremiah Blocki; Seunghoon Lee 004; Tamalika Mukherjee; Samson Zhou (ICLR, 2023)

Computationally Relaxed Locally Decodable Codes, Revisited. - Alexander R. Block; Jeremiah Blocki (ISIT, 2023)

Towards a Rigorous Statistical Analysis of Empirical Password Datasets. - Jeremiah Blocki; Peiyuan Liu (SP, 2023)

Confident Monte Carlo: Rigorous Analysis of Guessing Curves for Probabilistic Password Models. - Peiyuan Liu; Jeremiah Blocki; Wenjie Bai (SP, 2023)

Differentially Private L2-Heavy Hitters in the Sliding Window Model. - Jeremiah Blocki; Seunghoon Lee 004; Tamalika Mukherjee; Samson Zhou (CoRR, 2023)

Conditional Encryption with Applications to Secure Personalized Password Typo Correction. - Mohammad Hassan Ameri; Jeremiah Blocki (CCS, 2024)

The Impact of Reversibility on Parallel Pebbling. - Jeremiah Blocki; Blake Holman; Seunghoon Lee 004 (IACR Cryptol. ePrint Arch., 2024)

A Tight Lower Bound on the TdScrypt Trapdoor Memory-Hard Function. - Jeremiah Blocki; Seunghoon Lee 004 (IACR Cryptol. ePrint Arch., 2024)

Cost-asymmetric memory hard password hashing. - Wenjie Bai; Jeremiah Blocki; Mohammad Hassan Ameri (Inf. Comput., 2024)

Bandwidth-Hard Functions: Reductions and Lower Bounds. - Jeremiah Blocki; Peiyuan Liu; Ling Ren 001; Samson Zhou (J. Cryptol., 2024)

Differential Privacy and Sublinear Time Are Incompatible Sometimes. - Jeremiah Blocki; Hendrik Fichtenberger; Elena Grigorescu; Tamalika Mukherjee (ITCS, 2025)

Preprocessing Security in Multiple Idealized Models with Applications to Schnorr Signatures and PSEC-KEM. - Jeremiah Blocki; Seunghoon Lee 004 (IACR Cryptol. ePrint Arch., 2025)

Differentially Private Compression and the Sensitivity of LZ77. - Jeremiah Blocki; Seunghoon Lee 004; Brayan Sebastián Yepes Garcia (CoRR, 2025)

Amortized Locally Decodable Codes. - Jeremiah Blocki; Justin Zhang 008 (CoRR, 2025)

Amortized Locally Decodable Codes for Insertions and Deletions. - Jeremiah Blocki; Justin Zhang (CoRR, 2025)