Jeremiah Blocki

Elena Grigorescu

Tamalika Mukherjee

Proceedings of the Approximation, 2023

2022

DALock: Password Distribution-Aware Throttling.

[BibT_eX]

[DOI]

Wuwei Zhang

Proc. Priv. Enhancing Technol., 2022

The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs.

[BibT_eX]

[DOI]

Blake Holman

IACR Cryptol. ePrint Arch., 2022

Sustained Space and Cumulative Complexity Trade-offs for Data-Dependent Memory-Hard Functions.

[BibT_eX]

[DOI]

Blake Holman

IACR Cryptol. ePrint Arch., 2022

Using Illustrations to Communicate Differential Privacy Trust Models: An Investigation of Users' Comprehension, Perception, and Data Sharing Decision.

[BibT_eX]

[DOI]

CoRR, 2022

On Explicit Constructions of Extremely Depth Robust Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Privately Estimating Graph Parameters in Sublinear Time.

[BibT_eX]

[DOI]

Elena Grigorescu

Tamalika Mukherjee

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

On the Multi-user Security of Short Schnorr Signatures with Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021

Relaxed Locally Correctable Codes in Computationally Bounded Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes.

[BibT_eX]

[DOI]

Mohammad Hassan Ameri

Alexander R. Block

IACR Cryptol. ePrint Arch., 2021

Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs.

[BibT_eX]

[DOI]

CoRR, 2021

Bicycle attacks considered harmful: Quantifying the damage of widespread password length leakage.

[BibT_eX]

[DOI]

Comput. Secur., 2021

Differentially-Private Sublinear-Time Clustering.

[BibT_eX]

[DOI]

Elena Grigorescu

Tamalika Mukherjee

Proceedings of the IEEE International Symposium on Information Theory, 2021

Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions.

[BibT_eX]

[DOI]

Alexander R. Block

Proceedings of the IEEE International Symposium on Information Theory, 2021

A New Connection Between Node and Edge Depth Robust Graphs.

[BibT_eX]

[DOI]

Mike Cinkoske

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

HACCLE: metaprogramming for secure multi-party computation.

[BibT_eX]

[DOI]

Proceedings of the GPCE '21: Concepts and Experiences, Chicago, IL, USA, October 17, 2021

Password Strength Signaling: A Counter-Intuitive Defense Against Password Cracking.

[BibT_eX]

[DOI]

Wenjie Bai

Proceedings of the Decision and Game Theory for Security - 12th International Conference, 2021

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

DAHash: Distribution Aware Tuning of Password Hashing Costs.

[BibT_eX]

[DOI]

Wenjie Bai

Proceedings of the Financial Cryptography and Data Security, 2021

On the Security of Proofs of Sequential Work in a Post-Quantum World.

[BibT_eX]

[DOI]

Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020

Information Signaling: A Counter-Intuitive Defense Against Password Cracking.

[BibT_eX]

[DOI]

Wenjie Bai

CoRR, 2020

HACCLE: An Ecosystem for Building Secure Multi-Party Computations.

[BibT_eX]

[DOI]

Yuyan Bao

Kirshanthan Sundararajah

Mohammad Hassan Ameri

Pierre-David Letourneau

CoRR, 2020

DALock: Distribution Aware Password Throttling.

[BibT_eX]

[DOI]

Wuwei Zhang

CoRR, 2020

An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers.

[BibT_eX]

[DOI]

CoRR, 2020

Approximating Cumulative Pebbling Cost Is Unique Games Hard.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Computationally Data-Independent Memory Hard Functions.

[BibT_eX]

[DOI]

Mohammad Hassan Ameri

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

On Locally Decodable Codes in Resource Bounded Channels.

[BibT_eX]

[DOI]

Shubhang Kulkarni

Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Locally Decodable/Correctable Codes for Insertions and Deletions.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

On the Multi-User Security of Short Schnorr Signatures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

2018

Just in Time Hashing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Bandwidth-Hard Functions: Reductions and Lower Bounds.

[BibT_eX]

[DOI]

Ling Ren

IACR Cryptol. ePrint Arch., 2018

Sustained Space Complexity.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

IACR Cryptol. ePrint Arch., 2018

On the Economics of Offline Password Cracking.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE Symposium on Security and Privacy, 2018

Brief Announcement: Relaxed Locally Correctable Codes in Computationally Bounded Channels.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling.

[BibT_eX]

[DOI]

Proceedings of the Financial Cryptography and Data Security, 2018

2017

On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Practical Graphs for Optimal Side-Channel Resistant Memory-Hard Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2017

Optimizing Locally Differentially Private Protocols.

[BibT_eX]

[DOI]

CoRR, 2017

Locally Differentially Private Protocols for Frequency Estimation.

[BibT_eX]

[DOI]

Proceedings of the 26th USENIX Security Symposium, 2017

Towards Human Computable Passwords.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond.

[BibT_eX]

[DOI]

Hong-Sheng Zhou

IACR Cryptol. ePrint Arch., 2016

Differentially Private Password Frequency Lists.

[BibT_eX]

[DOI]

Joseph Bonneau

IACR Cryptol. ePrint Arch., 2016

Depth-Robust Graphs and Their Cumulative Memory Complexity.

[BibT_eX]

[DOI]

Krzysztof Pietrzak

IACR Cryptol. ePrint Arch., 2016

Towards Practical Attacks on Argon2i and Balloon Hashing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

Efficiently Computing Data-Independent Memory-Hard Functions.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

CASH: A Cost Asymmetric Secure Hash Algorithm for Optimal Password Protection.

[BibT_eX]

[DOI]

Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

Client-CASH: Protecting Master Passwords against Offline Attacks.

[BibT_eX]

[DOI]

Anirudh Sridhar

Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, 2016

2015

Naturally Rehearsing Passwords.

[BibT_eX]

[DOI]

Manuel Blum

IACR Cryptol. ePrint Arch., 2015

Spaced Repetition and Mnemonics Enable Recall of Multiple Strong Passwords.

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Network and Distributed System Security Symposium, 2015

Audit Games with Multiple Defender Resources.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Human Computable Passwords.

[BibT_eX]

[DOI]

Manuel Blum

CoRR, 2014

Set Families with Low Pairwise Intersection.

[BibT_eX]

[DOI]

Calvin Beideman

CoRR, 2014

2013

Optimizing password composition policies.

[BibT_eX]

[DOI]

Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Differentially private data analysis of social networks via restricted sensitivity.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science, 2013

Audit Games.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Adaptive Regret Minimization in Bounded-Memory Games.

[BibT_eX]

[DOI]

Proceedings of the Decision and Game Theory for Security - 4th International Conference, 2013

GOTCHA password hackers!

[BibT_eX]

[DOI]

Manuel Blum

Proceedings of the AISec'13, 2013

2012

Audit Mechanisms for Provable Risk Management and Accountable Data Governance.

[BibT_eX]

[DOI]

Proceedings of the Decision and Game Theory for Security - Third International Conference, 2012

The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Take Two Software Updates and See Me in the Morning: The Case for Software Security Evaluations of Medical Devices.

[BibT_eX]

[DOI]

Steve Hanna

Rolf Rolles

Andres Molina-Markham

Proceedings of the 2nd USENIX Workshop on Health Security and Privacy, 2011

Audit Mechanisms for Privacy Protection in Healthcare Environments.

[BibT_eX]

[DOI]

Proceedings of the 2nd USENIX Workshop on Health Security and Privacy, 2011

Understanding and Protecting Privacy: Formal Semantics and Principled Audit Mechanisms.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Security - 7th International Conference, 2011

Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

2010

Resolving the Complexity of Some Data Privacy Problems.

[BibT_eX]

[DOI]