◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

F. Kerschbaum

36 papers hereh-index 456.4k citations211 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3
  • middle author7
  • last author25

Across the 35 of 36 papers where every author was matched, so the position is known.

fields
  • cs.CR30
  • cs.DB2
  • cs.LG2
  • cs.AI1
  • cs.CV1
same name
  • F. Kerschbaum — 54 papers, h 33
  • F. Kerschbaum — 9 papers
  • F. Kerschbaum — 8 papers, h 3

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102023
most citedIdentifying and Mitigating the Security Risks of Generative AI

55 citations · 220 across the 35 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

cs.LG2019★ 22 cited

Deep Neural Network Fingerprinting by Conferrable Adversarial Examples

Nils Lukas, Yuxuan Zhang, Florian Kerschbaum

In Machine Learning as a Service, a provider trains a deep neural network and gives many users access. The hosted (source) model is susceptible to model stealing attacks, where an…

cs.CR2019★ 13 cited

RIGA: Covert and Robust White-Box Watermarking of Deep Neural Networks

Tianhao Wang, Florian Kerschbaum

Watermarking of deep neural networks (DNN) can enable their tracing once released by a data owner. In this paper, we generalize white-box watermarking algorithms for DNNs, where th…

cs.CR2019★ 1 cited

Non-Interactive Private Decision Tree Evaluation

Anselme Tueno, Yordan Boev, Florian Kerschbaum

Decision trees are a powerful prediction model with many applications in statistics, data mining, and machine learning. In some settings, the model and the data to be classified ma…

cs.CR2019★ 4 cited

Secure Computation of the kth-Ranked Element in a Star Network

Anselme Tueno, Florian Kerschbaum, Stefan Katzenbeisser +2

We consider the problem of securely computing the kth-ranked element in a sequence of n private integers distributed among n parties. The kth-ranked element (e.g., minimum, maximum…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.