Zobrazeno 1 - 10
of 400
pro vyhledávání: '"Moni Naor"'
Autor:
Cynthia Dwork, Moni Naor
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 2, Iss 1 (2010)
In 1977 Tore Dalenius articulated a desideratum for statistical databases: nothing about an individual should be learnable from the database that cannot be learned without access to the database. We give a general impossibility result showing that
Externí odkaz:
https://doaj.org/article/e43ea7eb5d304708803189e0f2723583
Publikováno v:
STOC
Searchable symmetric encryption (SSE) enables a client to store a database on an untrusted server while supporting keyword search in a secure manner. Despite the rapidly increasing interest in SSE technology, experiments indicate that the performance
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64dd15d0b29ba7098109f8e546766af0
https://doi.org/10.1137/19m1303186
https://doi.org/10.1137/19m1303186
Autor:
Shahar P. Cohen, Moni Naor
Publikováno v:
Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159817
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a273ca84db752db5fa2d09f67ee0d040
https://doi.org/10.1007/978-3-031-15982-4_9
https://doi.org/10.1007/978-3-031-15982-4_9
Publikováno v:
Theory of Cryptography ISBN: 9783031223648
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94348773c26535ca88f4f7e3009d0100
https://doi.org/10.1007/978-3-031-22365-5_27
https://doi.org/10.1007/978-3-031-22365-5_27
Publikováno v:
Advances in Cryptology – CRYPTO 2022 ISBN: 9783031159787
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3cb3a24a97b7cdc5a63c69bcbe72f0a1
https://doi.org/10.1007/978-3-031-15979-4_23
https://doi.org/10.1007/978-3-031-15979-4_23
Publikováno v:
FOCS
Ramsey theory assures us that in any graph there is a clique or independent set of a certain size, roughly logarithmic in the graph size. But how difficult is it to find the clique or independent set? If the graph is given explicitly, then it is poss
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73fd2591de4071bc9909c60fb754d442
https://doi.org/10.1145/3341106
https://doi.org/10.1145/3341106
Autor:
Moni Naor, Yogev Eylon
Publikováno v:
ACM Transactions on Algorithms. 15:1-30
Many efficient data structures use randomness, allowing them to improve upon deterministic ones. Usually, their efficiency and correctness are analyzed using probabilistic tools under the assumption that the inputs and queries are independent of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c36153c52748a60d212ca36f168ae1cb
https://doi.org/10.1145/3306193
https://doi.org/10.1145/3306193
Publikováno v:
Journal of Cryptology
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::552800ded1bb9a4e7bdd8825bad485d3
http://arxiv.org/abs/2105.01409
http://arxiv.org/abs/2105.01409
Publikováno v:
STOC
Laws of large numbers guarantee that given a large enough sample from some population, the measure of any fixed sub-population is well-estimated by its frequency in the sample. We study laws of large numbers in sampling processes that can affect the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9185e0c3a940313c6a6b1ae8d7931b5
http://arxiv.org/abs/2101.09054
http://arxiv.org/abs/2101.09054