Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Yeo, Kevin"'
Autor:
Larsen, Kasper Green, Pagh, Rasmus, Persiano, Giuseppe, Pitassi, Toniann, Yeo, Kevin, Zamir, Or
We present a simple and provably optimal non-adaptive cell probe data structure for the static dictionary problem. Our data structure supports storing a set of n key-value pairs from [u]x[u] using s words of space and answering key lookup queries in
Externí odkaz:
http://arxiv.org/abs/2308.16042
Autor:
Yeo, Kevin
Cuckoo hashing is a powerful primitive that enables storing items using small space with efficient querying. At a high level, cuckoo hashing maps $n$ items into $b$ entries storing at most $\ell$ items such that each item is placed into one of $k$ ra
Externí odkaz:
http://arxiv.org/abs/2306.11220
The Web public key infrastructure is essential to providing secure communication on the Internet today, and certificate authorities play a crucial role in this ecosystem by issuing certificates. These authorities may misissue certificates or suffer m
Externí odkaz:
http://arxiv.org/abs/2203.01661
Autor:
Persiano, Giuseppe, Yeo, Kevin
In this paper, we study the static cell probe complexity of non-adaptive data structures that maintain a subset of $n$ points from a universe consisting of $m=n^{1+\Omega(1)}$ points. A data structure is defined to be non-adaptive when the memory loc
Externí odkaz:
http://arxiv.org/abs/2001.05053
Oblivious RAM (ORAM) and private information retrieval (PIR) are classic cryptographic primitives used to hide the access pattern to data whose storage has been outsourced to an untrusted server. Unfortunately, both primitives require considerable ov
Externí odkaz:
http://arxiv.org/abs/1904.05452
We prove an $\Omega(d \lg n/ (\lg\lg n)^2)$ lower bound on the dynamic cell-probe complexity of statistically $\mathit{oblivious}$ approximate-near-neighbor search ($\mathsf{ANN}$) over the $d$-dimensional Hamming cube. For the natural setting of $d
Externí odkaz:
http://arxiv.org/abs/1904.04828
We consider Oblivious Shuffling and K-Oblivious Shuffling, a refinement thereof. We provide efficient algorithms for both and discuss their application to the design of Oblivious RAM. The task of K-Oblivious Shuffling is to obliviously shuffle N encr
Externí odkaz:
http://arxiv.org/abs/1705.07069
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dodis, Yevgeniy, Yeo, Kevin
In this work we challenge the common misconception that information-theoretic (IT) privacy is too impractical to be used in the real-world: we propose to build simple and reusable IT-encryption solutions whose only efficiency penalty (compared to com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e8677c8a032b43d7fa852500a1c3579
Publikováno v:
Larsen, K G, Simkin, M & Yeo, K 2020, Lower Bounds for Multi-server Oblivious RAMs . in R Pass & K Pietrzak (eds), Theory of Cryptography . Springer, Cham, Lecture Notes in Computer Science, vol. 12550, pp. 486-503, 18th International Conference, TCC 2020, Durham, United States, 16/11/2020 . https://doi.org/10.1007/978-3-030-64375-1_17
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::dac6903f5125e13507eef96883559a01
https://pure.au.dk/portal/da/publications/lower-bounds-for-multiserver-oblivious-rams(7c64a46e-fbe3-428f-9865-b71c673db68a).html
https://pure.au.dk/portal/da/publications/lower-bounds-for-multiserver-oblivious-rams(7c64a46e-fbe3-428f-9865-b71c673db68a).html