default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXinda Li 0001
Person information
- affiliation: University of Waterloo, ON, Canada
Other persons with the same name
- Xinda Li 0002 — Changchun University of Science and Technology, China
- Xinda Li 0003
![[0009-0005-6321-6030]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0009-0005-6321-6030")
— Beihang University, Beijing, China - Xinda Li 0004 — State Grid Energy Research Institute Co. Ltd., China
- Xinda Li 0005 — Harbin Institute of Technology, Harbin, China
- Xinda Li 0006 — National University of Defense Technology, College of Electronic Science and Technology, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Abdulrahman Diaa, Lucas Fenaux, Thomas Humphries, Marian Dietz, Faezeh Ebrahimianghazani, Bailey Kacsmar, Xinda Li, Nils Lukas, Rasoul Akhavan Mahdavi, Simon Oya, Ehsan Amjadian, Florian Kerschbaum:
Fast and Private Inference of Deep Neural Networks by Co-designing Activation Functions. USENIX Security Symposium 2024- [c4]Rasoul Akhavan Mahdavi, Nils Lukas, Faezeh Ebrahimianghazani, Thomas Humphries, Bailey Kacsmar, John A. Premkumar, Xinda Li, Simon Oya, Ehsan Amjadian, Florian Kerschbaum:
PEPSI: Practically Efficient Private Set Intersection in the Unbalanced Setting. USENIX Security Symposium 2024 - 2023
- [j1]Zhuangfei Hu, Xinda Li, David P. Woodruff, Hongyang Zhang, Shufan Zhang:
Recovery From Non-Decomposable Distance Oracles. IEEE Trans. Inf. Theory 69(10): 6443-6469 (2023) - [c3]Zhuangfei Hu, Xinda Li, David P. Woodruff, Hongyang Zhang, Shufan Zhang:
Recovery from Non-Decomposable Distance Oracles. ITCS 2023: 73:1-73:22 - [i5]Abdulrahman Diaa, Lucas Fenaux, Thomas Humphries, Marian Dietz, Faezeh Ebrahimianghazani, Bailey Kacsmar, Xinda Li, Nils Lukas, Rasoul Akhavan Mahdavi, Simon Oya, Ehsan Amjadian, Florian Kerschbaum:
Fast and Private Inference of Deep Neural Networks by Co-designing Activation Functions. CoRR abs/2306.08538 (2023) - [i4]Rasoul Akhavan Mahdavi, Nils Lukas, Faezeh Ebrahimianghazani, Thomas Humphries, Bailey Kacsmar, John A. Premkumar, Xinda Li, Simon Oya, Ehsan Amjadian, Florian Kerschbaum:
PEPSI: Practically Efficient Private Set Intersection in the Unbalanced Setting. CoRR abs/2310.14565 (2023) - 2022
- [c2]Nils Lukas, Edward Jiang, Xinda Li, Florian Kerschbaum:
SoK: How Robust is Image Classification Deep Neural Network Watermarking? SP 2022: 787-804 - [i3]Zhuangfei Hu, Xinda Li, David P. Woodruff, Hongyang Zhang, Shufan Zhang:
Recovery from Non-Decomposable Distance Oracles. CoRR abs/2209.05676 (2022) - [i2]Yihan Wu, Xinda Li, Florian Kerschbaum, Heng Huang, Hongyang Zhang:
Towards Robust Dataset Learning. CoRR abs/2211.10752 (2022) - 2021
- [c1]Masoumeh Shafieinejad, Nils Lukas, Jiaqi Wang, Xinda Li, Florian Kerschbaum:
On the Robustness of Backdoor-based Watermarking in Deep Neural Networks. IH&MMSec 2021: 177-188 - [i1]Nils Lukas, Edward Jiang, Xinda Li, Florian Kerschbaum:
SoK: How Robust is Image Classification Deep Neural Network Watermarking? (Extended Version). CoRR abs/2108.04974 (2021)
Coauthor Index
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-09-05 02:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
