![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Hayim Shaul
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Nir Drucker
, Guy Moshkowich
, Tomer Pelleg
, Hayim Shaul
:
BLEACH: Cleaning Errors in Discrete Computations Over CKKS. J. Cryptol. 37(1): 3 (2024) - [j8]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Privacy Preserving Feature Selection for Sparse Linear Regression. Proc. Priv. Enhancing Technol. 2024(1): 300-313 (2024) - [j7]Eyal Kushnir, Guy Moshkowich, Hayim Shaul:
Secure Range-Searching Using Copy-And-Recurse. Proc. Priv. Enhancing Technol. 2024(3): 626-644 (2024) - 2023
- [j6]Ehud Aharoni
, Allon Adir, Moran Baruch, Nir Drucker
, Gilad Ezov, Ariel Farkash, Lev Greenberg, Ramy Masalha, Guy Moshkowich, Dov Murik, Hayim Shaul, Omri Soceanu:
HeLayers: A Tile Tensors Framework for Large Neural Networks on Encrypted Data. Proc. Priv. Enhancing Technol. 2023(1): 325-342 (2023) - [c10]Ehud Aharoni
, Nir Drucker
, Gilad Ezov
, Eyal Kushnir
, Hayim Shaul
, Omri Soceanu
:
Poster: Efficient AES-GCM Decryption Under Homomorphic Encryption. CCS 2023: 3567-3569 - [c9]Ehud Aharoni
, Nir Drucker
, Hayim Shaul
:
Tutorial-HEPack4ML '23: Advanced HE Packing Methods with Applications to ML. CCS 2023: 3669-3670 - [c8]Ehud Aharoni
, Nir Drucker
, Eyal Kushnir
, Ramy Masalha
, Hayim Shaul
:
Generating One-Hot Maps Under Encryption. CSCML 2023: 96-116 - [c7]Adi Akavia, Ben Galili
, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Efficient Privacy-Preserving Viral Strain Classification via k-mer Signatures and FHE. CSF 2023: 489-504 - [c6]Ehud Aharoni, Moran Baruch, Pradip Bose, Alper Buyuktosunoglu, Nir Drucker, Subhankar Pal, Tomer Pelleg, Kanthi K. Sarpatwar, Hayim Shaul, Omri Soceanu, Roman Vaculín:
Efficient Pruning for Machine Learning Under Homomorphic Encryption. ESORICS (4) 2023: 204-225 - [i15]Ehud Aharoni, Nir Drucker, Eyal Kushnir, Ramy Masalha, Hayim Shaul:
Generating One-Hot Maps under Encryption. CoRR abs/2306.06739 (2023) - [i14]Swanand Ravindra Kadhe, Heiko Ludwig, Nathalie Baracaldo, Alan King, Yi Zhou, Keith Houck, Ambrish Rawat, Mark Purcell, Naoise Holohan, Mikio Takeuchi, Ryo Kawahara, Nir Drucker, Hayim Shaul, Eyal Kushnir, Omri Soceanu:
Privacy-Preserving Federated Learning over Vertically and Horizontally Partitioned Data for Financial Anomaly Detection. CoRR abs/2310.19304 (2023) - [i13]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Efficient Privacy-Preserving Viral Strain Classification via k-mer Signatures and FHE. IACR Cryptol. ePrint Arch. 2023: 9 (2023) - [i12]Eyal Kushnir, Guy Moshkowich, Hayim Shaul:
Secure Range-Searching Using Copy-And-Recurse. IACR Cryptol. ePrint Arch. 2023: 983 (2023) - [i11]Ehud Aharoni, Nir Drucker, Gilad Ezov, Eyal Kushnir, Hayim Shaul, Omri Soceanu:
E2E near-standard and practical authenticated transciphering. IACR Cryptol. ePrint Arch. 2023: 1040 (2023) - [i10]Adi Akavia, Ben Galili, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Privacy Preserving Feature Selection for Sparse Linear Regression. IACR Cryptol. ePrint Arch. 2023: 1354 (2023) - 2022
- [j5]Ehud Aharoni
, Nir Drucker
, Gilad Ezov
, Hayim Shaul
, Omri Soceanu
:
Complex Encoded Tile Tensors: Accelerating Encrypted Analytics. IEEE Secur. Priv. 20(5): 35-43 (2022) - [i9]Ehud Aharoni, Moran Baruch, Pradip Bose, Alper Buyuktosunoglu, Nir Drucker, Subhankar Pal, Tomer Pelleg, Kanthi K. Sarpatwar, Hayim Shaul, Omri Soceanu, Roman Vaculín:
HE-PEx: Efficient Machine Learning under Homomorphic Encryption using Pruning, Permutation and Expansion. CoRR abs/2207.03384 (2022) - [i8]Nir Drucker, Guy Moshkowich, Tomer Pelleg, Hayim Shaul:
BLEACH: Cleaning Errors in Discrete Computations over CKKS. IACR Cryptol. ePrint Arch. 2022: 1298 (2022) - 2020
- [j4]Hayim Shaul, Dan Feldman, Daniela Rus:
Secure k-ish Nearest Neighbors Classifier. Proc. Priv. Enhancing Technol. 2020(3): 42-61 (2020) - [i7]Hayim Shaul, Dan Feldman, Daniela Rus:
Secure k-ish nearest neighbors classifier. IACR Cryptol. ePrint Arch. 2020: 319 (2020)
2010 – 2019
- 2019
- [j3]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Data Retrieval on the Cloud: Homomorphic Encryption meets Coresets. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(2): 80-106 (2019) - [c5]Adi Akavia, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Linear-Regression on Packed Encrypted Data in the Two-Server Model. WAHC@CCS 2019: 21-32 - [i6]Adi Akavia, Hayim Shaul, Mor Weiss, Zohar Yakhini:
Linear-Regression on Packed Encrypted Data in the Two-Server Model. IACR Cryptol. ePrint Arch. 2019: 1238 (2019) - 2018
- [c4]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Search on Encrypted Data via Multi-Ring Sketch. CCS 2018: 985-1001 - [i5]Hayim Shaul, Dan Feldman, Daniela Rus:
Scalable Secure Computation of Statistical Functions with Applications to k-Nearest Neighbors. CoRR abs/1801.07301 (2018) - [i4]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Search via Multi-Ring Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2018: 245 (2018) - [i3]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Data Retrieval On The Cloud Homomorphic Encryption Meets Coresets. IACR Cryptol. ePrint Arch. 2018: 1003 (2018) - 2017
- [i2]Adi Akavia, Dan Feldman, Hayim Shaul:
Secure Search on the Cloud via Coresets and Sketches. CoRR abs/1708.05811 (2017) - 2011
- [b1]Hayim Shaul:
Range searching: emptiness, reporting, and approximate counting. Tel Aviv University, Israel, 2011 - [j2]Micha Sharir, Hayim Shaul:
Semialgebraic Range Reporting and Emptiness Searching with Applications. SIAM J. Comput. 40(4): 1045-1074 (2011)
2000 – 2009
- 2009
- [i1]Micha Sharir, Hayim Shaul:
Semi-algebraic Range Reporting and Emptiness Searching with Applications. CoRR abs/0908.4061 (2009) - 2005
- [j1]Micha Sharir, Hayim Shaul:
Ray shooting and stone throwing with near-linear storage. Comput. Geom. 30(3): 239-252 (2005) - [c3]Micha Sharir, Hayim Shaul:
Ray shooting amid balls, farthest point from a line, and range emptiness searching. SODA 2005: 525-534 - 2003
- [c2]Micha Sharir, Hayim Shaul:
Ray Shooting and Stone Throwing. ESA 2003: 470-481 - 2002
- [c1]Hayim Shaul, Dan Halperin:
Improved construction of vertical decompositions of three-dimensional arrangements. SCG 2002: 283-292
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint