2 citations · 2 across the 5 of their papers we have counts for
5 papers
Adjacency Sketches in Adversarial Environments
Moni Naor, Eugene Pekel
An adjacency sketching or implicit labeling scheme for a family of graphs is a method that defines for any vertex an assignment of labels to each vertex…
Private Everlasting Prediction
Moni Naor, Kobbi Nissim, Uri Stemmer +1
A private learner is trained on a sample of labeled points and generates a hypothesis that can be used for predicting the labels of newly sampled points while protecting the privac…
New Algorithms and Applications for Risk-Limiting Audits
Bar Karov, Moni Naor
Risk-limiting audits (RLAs) are a significant tool in increasing confidence in the accuracy of elections. They consist of randomized algorithms which check that an election's vote…
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets
Amihood Amir, Oren Kapah, Tsvi Kopelowitz +2
We introduce and examine the {\em Holiday Gathering Problem} which models the difficulty that couples have when trying to decide with which parents should they spend the holiday. O…
Secret-Sharing for NP
Ilan Komargodski, Moni Naor, Eylon Yogev
A computational secret-sharing scheme is a method that enables a dealer, that has a secret, to distribute this secret among a set of parties such that a "qualified" subset of parti…