research
∙
09/07/2023
Adjacency Sketches in Adversarial Environments
An adjacency sketching or implicit labeling scheme for a family F of gra...
share
research
∙
05/16/2023
Private Everlasting Prediction
A private learner is trained on a sample of labeled points and generates...
research
∙
05/06/2023
New Algorithms and Applications for Risk-Limiting Audits
Risk-limiting audits (RLAs) are a significant tool in increasing confide...
research
∙
07/11/2022
MPC for Tech Giants (GMPC): Enabling Gulliver and the Lilliputians to Cooperate Amicably
In this work, we introduce the Gulliver multi-party computation model (G...
research
∙
04/26/2022
Mirror Games Against an Open Book Player
Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and ...
research
∙
07/08/2021
Keep That Card in Mind: Card Guessing with Limited Memory
A card guessing game is played between two players, Guesser and Dealer. ...
research
∙
05/04/2021
Hardness-Preserving Reductions via Cuckoo Hashing
The focus of this work is hardness-preserving transformations of somewha...
research
∙
01/22/2021
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification
Laws of large numbers guarantee that given a large enough sample from so...
research
∙
04/06/2020
Can Two Walk Together: Privacy Enhancing Methods and Preventing Tracking of Users
We present a new concern when collecting data from individuals that aris...
research
∙
11/22/2019
Privately Learning Thresholds: Closing the Exponential Gap
We study the sample complexity of learning threshold functions under the...
research
∙
12/28/2018