1 citations · 1 across the 1 of their papers we have counts for
4 papers
A probabilistic variant of Sperner's theorem and of maximal -cover free families
Noga Alon, Shoni Gilboa, Shay Gueron
A family of sets is called -\emph{cover free} if no set in the family is contained in the union of (or less) other sets in the family. A -cover free family is simply an a…
Fault Attacks on Encrypted General Purpose Compute Platforms
Robert Buhren, Shay Gueron, Jan Nordholz +2
Adversaries with physical access to a target platform can perform cold boot or DMA attacks to extract sensitive data from the RAM. In response, several main-memory encryption schem…
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 bits of permutations of $\{0, 1\}^{n…
Distinguishing a truncated random permutation from a random function
Shoni Gilboa, Shay Gueron
An oracle chooses a function from the set of bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an -bit…