Zobrazeno 1 - 10
of 119
pro vyhledávání: '"Gilboa, Niv"'
Publikováno v:
ITCS 2022
Can we sense our location in an unfamiliar environment by taking a sublinear-size sample of our surroundings? Can we efficiently encrypt a message that only someone physically close to us can decrypt? To solve this kind of problems, we introduce and
Externí odkaz:
http://arxiv.org/abs/2201.03041
This paper presents Poplar, a new system for solving the private heavy-hitters problem. In this problem, there are many clients and a small set of data-collection servers. Each client holds a private bitstring. The servers want to recover the set of
Externí odkaz:
http://arxiv.org/abs/2012.14884
Many organizations protect secure networked devices from non-secure networked devices by assigning each class of devices to a different logical network. These two logical networks, commonly called the host network and the guest network, use the same
Externí odkaz:
http://arxiv.org/abs/1908.02524
Autor:
Shvartzman, Oren, Ovadya, Adar, Zvi, Kfir, Shwartz, Omer, Ogen, Rom, Mallah, Yakov, Gilboa, Niv, Oren, Yossi
Publikováno v:
In Computers & Security April 2023 127
In the problem of swarm computing, $n$ agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of
Externí odkaz:
http://arxiv.org/abs/1208.4909
Publikováno v:
In Information and Computation August 2017 255 Part 3:384-407
Publikováno v:
Journal of Mathematical Cryptology, Vol 9, Iss 2, Pp 79-94 (2015)
In the problem of private “swarm” computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about
Externí odkaz:
https://doaj.org/article/7007c1c332d246928f292ddabcba0877
Publikováno v:
In Ad Hoc Networks January 2014 12:193-200
A distributed point function (DPF) (Gilboa-Ishai, Eurocrypt 2014) is a cryptographic primitive that enables compressed additive secret-sharing of a secret weight-1 vector across two or more servers. DPFs support a wide range of cryptographic applicat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eee71198dd08531c27dbc5a53b6d0a5e
Autor:
Boyle, Elette, Couteau, Geoffroy, Gilboa, Niv, Ishai, Yuval, Kohl, Lisa, Resch, Nicolas, Scholl, Peter
Publikováno v:
Boyle, E, Couteau, G, Gilboa, N, Ishai, Y, Kohl, L, Resch, N & Scholl, P 2022, Correlated Pseudorandomness from Expand-Accumulate Codes . in Y Dodis & T Shrimpton (eds), Advances in Cryptology-CRYPTO 2022-42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part II . vol. 13508, Springer, Lecture Notes in Computer Science, pp. 603-633 . https://doi.org/10.1007/978-3-031-15979-421
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::175cf312483b54ed8c5817a09f1205e9
https://pure.au.dk/portal/da/publications/correlated-pseudorandomness-from-expandaccumulate-codes(a2215efe-e696-4571-99da-588f5407591c).html
https://pure.au.dk/portal/da/publications/correlated-pseudorandomness-from-expandaccumulate-codes(a2215efe-e696-4571-99da-588f5407591c).html