Shoni Gilboa
Open University of Israel
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Shoni Gilboa.
Journal of Cryptology | 2018
Shoni Gilboa; Shay Gueron; Ben Morris
An oracle chooses a function f from the set of n bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an n-bit string w, the oracle computes f(w), truncates the m last bits, and returns only the first
European Journal of Combinatorics | 2017
Shoni Gilboa; Dan Hefetz
Constructive Approximation | 2017
Shoni Gilboa; Ron Peled
n-m
Journal of Approximation Theory | 2015
Shoni Gilboa; Ron Peled
arXiv: Combinatorics | 2016
Shoni Gilboa; Shay Gueron
n-m bits of f(w). How many queries does a querying adversary need to submit in order to distinguish the truncated permutation from the (truncated) function? In Hall et al. (Building PRFs from PRPs, Springer, Berlin, 1998) showed an algorithm for determining (with high probability) whether or not f is a permutation, using
IACR Cryptology ePrint Archive | 2015
Shoni Gilboa; Shay Gueron
arXiv: Cryptography and Security | 2016
Shoni Gilboa; Shay Gueron; Mridul Nandi
O(2^{\frac{m+n}{2}})
Graphs and Combinatorics | 2016
Shoni Gilboa; Yehuda Roditty
Ars Combinatoria | 2015
Arie Bialostocki; Shoni Gilboa; Yehuda Roditty
O(2m+n2) queries. They also showed that if
arXiv: Combinatorics | 2018
Shoni Gilboa; Shay Gueron
