S. Gueron

activity

20142018

most citedHow many queries are needed to distinguish a truncated random permutation from a random function?

17 citations · 47 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2018★ 1 cited

A probabilistic variant of Sperner's theorem and of maximal $r$ -cover free families

Noga Alon, Shoni Gilboa, Shay Gueron

A family of sets is called $r$ -\emph{cover free} if no set in the family is contained in the union of $r$ (or less) other sets in the family. A $1$ -cover free family is simply an a…

math.CO2016★ 16 cited

The Advantage of Truncated Permutations

Shoni Gilboa, Shay Gueron

Constructing a Pseudo Random Function (PRF) is a fundamental problem in cryptology. Such a construction, implemented by truncating the last $m$ bits of permutations of $\{0, 1\}^{n…

A probabilistic variant of Sperner's theorem and of maximal r-cover free families

The Advantage of Truncated Permutations

A probabilistic variant of Sperner's theorem and of maximal $r$ -cover free families