The Impact of Reversibility on Parallel Pebbling. with Blake Holman and Seunghoon Lee. EUROCRYPT 2025. [Full Version]
Confident Monte Carlo: Rigorous Analysis of Guessing Curves for Probabilistic Password Models. With Peiyuan Liu and Wenjie Bai. IEEE S&P 2023. [Full Version]
The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs. with Blake Holman and Seunghoon Lee. TCC 2022 [Full Version]
Towards a Rigorous Statistical Analysis of Empirical Password Datasets. with Peiyuan Liu. IEEE S&P 2023. [Full Version]
Cost-Asymmetric Memory Hard Password Hashing. with Mohammad Hassan Ameri and Wenjie Bai. SCN 2022. [Full Version]
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes. with Mohammad Hassan Ameri and Alex Block. SCN 2022. [Full Version]
Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions. with Blake Holman. CRYPTO 2022. [Full Version]
On Explicit Constructions of Extremely Depth Robust Graphs. with Mike Cinkoske, Seunghoon Lee and Jin Young Son. STACS 2022. [Full Version]
DAHash: Distribution Aware Tuning of Password Hashing Costs. with Wenjie Bai. FC 2021 [Full Version]
A New Connection Between Node and Edge Depth Robust Graphs. with Mike Cinkoske. ITCS 2021 [Full Version]
Computationally Data-Independent Memory Hard Functions. with Mohammad Hassan Ameri and Samson Zhou. ITCS 2020 [Full Version]
Approximating Cumulative Pebbling Cost is Unique Games Hard. with Seunghoon Lee and Samson Zhou. ITCS 2020 [Full Version]
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 [Full Version]
Bandwidth-Hard Functions: Reductions and Lower Bounds. with Ling Ren and Samson Zhou. CCS 2018 [Full Version]
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. with Alex Block, Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu. CCC 2023 [Full Version]
Exponential Lower Bounds for Locally Decodable Codes Correcting Insertions and Deletions. with Kuan Cheng, Elena Grigorescu, Xin Li, Yu Zheng, Minshen Zhu. FOCS 2021. [Full Version]
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions. with Alexander Block. ISIT 2021 [Full Version]
Locally Decodable/Correctable Codes for Insertions and Deletions. with Alex Block, Elena Grigorescu, Shubhang Kulkarni and Minshen Zhou. FSTTCS 2020 [Full Version]
On Locally Decodable Codes in Resource Bounded Channels. with Shubhang Kulkarni and Samson Zhou. ITC 2020 [Full Version]
Surviving in the Digital Environment: Does Survival Processing Provide an Additional Memory Benefit to Password Generation Strategies? with Isis Chong, Robert Proctor and Ninghui Li. Journal of Applied Research in Memory and Cognition 2020 [DOI]
Optimizing Password Composition Policies. with Saranga Komanduri, Ariel Procaccia and Or Sheffet. EC 2013. [Full Version]
Privacy Preserving Data Analysis
Differential privacy and Sublinear time are incompatible sometimes. with Hendrik Fichtenberger, Elena Grigorescu, Tamalika Mukherjee. ITCS 2025 [Full Version]
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity. with Elena Grigorescu, Tamalika Mukherjee and Samson Zhou. RANDOM 2023 [Full Version]
Differentially Private L2-Heavy Hitters in the Sliding Window Model. with Seunghoon Lee, Tamalika Mukherjee and Samson Zhou. ICLR 2023
Privately Estimating Graph Parameters in Sublinear time. with Elena Grigorescu and Tamalika Mukherjee. ICALP 2022. [Full Version]
Differentially Private Sublinear-Time Clustering. with Elena Grigorescu and Tamalika Mukherjee. ISIT 2021
Locally Differentially Private Protocols for Frequency Estimation. with Tianhao Wang, Ninghui Li and Somesh Jha. USENIX 2017. Full Version
Differentially Private Password Frequency Lists: Or, How to release statistics from 70 million passwords (on purpose). with Anupam Datta and Joseph Bonneau. NDSS 2016. [Full Version] [Yahoo! Password Frequency Corpus]
Differentially Private Data Analysis of Social Networks via Restricted Sensitivity. with Avrim Blum, Anupam Datta and Or Sheffet. ITCS 2013. [Full Version]
The Johnson-Lindenstrausss Transform Itself Preserves Differential Privacy. with Avrim Blum, Anupam Datta and Or Sheffet. FOCS 2012. [Full Version]
Resolving the Complexity of Some Data Privacy Problems. with Ryan Williams. ICALP 2010. [Full Version]
Game Theory and Security
Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking. with Wenjie Bai and Ben Harsha. GameSec 2021. [Full Version]
An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers. with Ben Harsha. WEIS 2020 [Full Version]
Audit Games with Multiple Defender Resources. with Nicolas Christin, Anupam Datta, Ariel Procaccia and Arunesh Sinha. AAAI 2015. [Full Version]
Audit Games. with Nicolas Christin, Anupam Datta, Ariel Procaccia and Arunesh Sinha. IJCAI 2013. [Full Version]
Adaptive Regret Minimization in Bounded-Memory Games. with Nicolas Christin, Anupam Datta and Arunesh Sinha. GameSec 2013. [Invited Paper] [Full Version]
Audit Mechanisms for Privacy Protection in Healthcare Environments. with Nicolas Christin, Anupam Datta and Arunesh Sinha. HealthSec 2011. [position paper]
Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection. with Nicolas Christin, Anupam Datta and Arunesh Sinha. CSF 2011. [Full Version]
Cryptography/Miscelaneous
On the Multi-User Security of Short Schnorr Signatures with Preprocessing. with Seunghoon Lee. EUROCRYPT 2022 . [Full Version]
HACCLE: Metaprogramming for Secure Multi-Party Computation with 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, Pierre-David Letourneau, Benoit Meister, Jonathan Springer, Tiark Rompf, and Milind Kulkarni. GPCE 2021.
On the Security of Proofs of Sequential Work in a Post-Quantum World. with Seunghoon Lee and Samson Zhou. ITC 2021 [Full Version]