research
∙
05/01/2023
Computationally Relaxed Locally Decodable Codes, Revisited
We revisit computationally relaxed locally decodable codes (crLDCs) (Blo...
share
research
∙
02/22/2023
Differentially Private L_2-Heavy Hitters in the Sliding Window Model
The data management of large companies often prioritize more recent data...
research
∙
10/07/2022
How to Make Your Approximation Algorithm Private: A Black-Box Differentially-Private Transformation for Tunable Approximation Algorithms of Functions with Low Sensitivity
We develop a framework for efficiently transforming certain approximatio...
research
∙
09/19/2022
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors
Locally Decodable Codes (LDCs) are error-correcting codes C:Σ^n→Σ^m with...
research
∙
06/26/2022
Cost-Asymmetric Memory Hard Password Hashing
In the past decade, billions of user passwords have been exposed to the ...
research
∙
02/21/2022
Using Illustrations to Communicate Differential Privacy Trust Models: An Investigation of Users' Comprehension, Perception, and Data Sharing Decision
Proper communication is key to the adoption and implementation of differ...
research
∙
02/11/2022
Privately Estimating Graph Parameters in Sublinear time
We initiate a systematic study of algorithms that are both differentiall...
research
∙
12/27/2021
Differentially-Private Sublinear-Time Clustering
Clustering is an essential primitive in unsupervised machine learning. W...
research
∙
11/01/2021
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
Locally Decodable Codes (LDCs) are error-correcting codes for which indi...
research
∙
10/08/2021
Parallel Quantum Pebbling: Analyzing the Post-Quantum Security of iMHFs
The classical (parallel) black pebbling game is a useful abstraction whi...
research
∙
10/08/2021
On Explicit Constructions of Extremely Depth Robust Graphs
A directed acyclic graph G=(V,E) is said to be (e,d)-depth robust if for...
research
∙
05/29/2021
Towards a Rigorous Statistical Analysis of Empirical Password Datasets
In this paper we consider the following problem: given N independent sam...
research
∙
03/25/2021
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions
We construct locally decodable codes (LDCs) to correct insertion-deletio...
research
∙
01/25/2021
DAHash: Distribution Aware Tuning of Password Hashing Costs
An attacker who breaks into an authentication server and steals all of t...
research
∙
10/22/2020
Locally Decodable/Correctable Codes for Insertions and Deletions
Recent efforts in coding theory have focused on building codes for inser...
research
∙
09/21/2020
Information Signaling: A Counter-Intuitive Defense Against Password Cracking
We introduce password strength information signaling as a novel, yet cou...
research
∙
09/03/2020
HACCLE: An Ecosystem for Building Secure Multi-Party Computations
Cryptographic techniques have the potential to enable distrusting partie...
research
∙
06/19/2020
On the Security of Proofs of Sequential Work in a Post-Quantum World
A proof of sequential work allows a prover to convince a resource-bounde...
research
∙
06/09/2020
On the Economics of Offline Password Cracking
We develop an economic model of an offline password cracker which allows...
research
∙
05/18/2020
DALock: Distribution Aware Password Throttling
Large-scale online password guessing attacks are wide-spread and continu...
research
∙
05/12/2020
An Economic Model for Quantum Key-Recovery Attacks against Ideal Ciphers
It has been established that quantum algorithms can solve several key cr...
research
∙
02/04/2020
Bicycle Attacks Considered Harmful: Quantifying the Damage of Widespread Password Length Leakage
We examine the issue of password length leakage via encrypted traffic i....
research
∙
11/15/2019
Computationally Data-Independent Memory Hard Functions
Memory hard functions (MHFs) are an important cryptographic primitive th...
research
∙
10/20/2019
A New Connection Between Node and Edge Depth Robust Graphs
We create a graph reduction that transforms an (e, d)-edge-depth-robust ...
research
∙
09/25/2019
On Locally Decodable Codes in Resource Bounded Channels
Constructions of locally decodable codes (LDCs) have one of two undesira...
research
∙
04/17/2019
Approximating Cumulative Pebbling Cost is Unique Games Hard
The cumulative pebbling complexity of a directed acyclic graph G is defi...
research
∙
03/15/2018
