Zobrazeno 1 - 10
of 19 283
pro vyhledávání: '"Naor, Moni"'
A tournament is an orientation of a complete graph. A vertex that can reach every other vertex within two steps is called a \emph{king}. We study the complexity of finding $k$ kings in a tournament graph. We show that the randomized query complexity
Externí odkaz:
http://arxiv.org/abs/2410.10475
Suppose you are given a function $f\colon [n] \to [n]$ via (black-box) query access to the function. You are looking to find something local, like a collision (a pair $x \neq y$ s.t. $f(x)=f(y)$). The question is whether knowing the "shape" of the fu
Externí odkaz:
http://arxiv.org/abs/2312.10196
Autor:
Naor, Moni, Pekel, Eugene
An adjacency sketching or implicit labeling scheme for a family $\cal F$ of graphs is a method that defines for any $n$ vertex $G \in \cal F$ an assignment of labels to each vertex in $G$, so that the labels of two vertices tell you whether or not th
Externí odkaz:
http://arxiv.org/abs/2309.03728
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 privacy of the training set [Kasiviswannathan et al., FOCS 2008]. Research u
Externí odkaz:
http://arxiv.org/abs/2305.09579
Autor:
Karov, Bar, Naor, Moni
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 tally, as reported by a vote tabulation system, corresponds to the cor
Externí odkaz:
http://arxiv.org/abs/2305.04050
In this work, we introduce the Gulliver multi-party computation model (GMPC). The GMPC model considers a single highly powerful party, called the server or Gulliver, that is connected to $n$ users over a star topology network (alternatively formulate
Externí odkaz:
http://arxiv.org/abs/2207.05047
Autor:
Magen, Roey, Naor, Moni
Mirror games were invented by Garg and Schnieder (ITCS 2019). Alice and Bob take turns (with Alice playing first) in declaring numbers from the set {1,2, ...2n}. If a player picks a number that was previously played, that player loses and the other p
Externí odkaz:
http://arxiv.org/abs/2204.12129
Autor:
Menuhin, Boaz, Naor, Moni
A card guessing game is played between two players, Guesser and Dealer. At the beginning of the game, the Dealer holds a deck of $n$ cards (labeled $1, ..., n$). For $n$ turns, the Dealer draws a card from the deck, the Guesser guesses which card was
Externí odkaz:
http://arxiv.org/abs/2107.03885
The focus of this work is \emph{hardness-preserving} transformations of somewhat limited pseudorandom functions families (PRFs) into ones with more versatile characteristics. Consider the problem of \emph{domain extension} of pseudorandom functions:
Externí odkaz:
http://arxiv.org/abs/2105.01409