Cited by 423Cryptography and Data SecurityPrivacy-Preserving Technologies in DataCloud Data Security Solutions

ML Confidential: Machine Learning on Encrypted Data

Graepel, Thore, Lauter, Kristin, Naehrig, Michael·2013·Lecture Notes in Computer Science

Integrity signals

Registry

Crossref · 10.1007/978-3-642-37682-5_1

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The ConfML protocol has been proposed for data owners to adhere to when they share training data with an ML service, and it protects the privacy of training data during the training process.

    “Towards that, Confidential Machine Learning, a.k.a.ConfML protocol, has been proposed that the data owners must adhere to when they share training data with an ML service [107].This protocol protects the privacy of training data during the training process.”
  • ConfML eliminates the vulnerability of data exposure during training by protecting the privacy of training data during the training process.

    “ConfML eliminates this vulnerability by protecting the privacy of training data during the training process [107].”

Cited by

Sorted by citations

Authors
Graepel, T., Lauter, K., & Naehrig, M.
Affiliations
Microsoft Research (United Kingdom) (GB)
Venue
Lecture Notes in Computer Science
Published
2013
Pages
1-21
ISSN
  • 0302-9743 (ISSN-L)
  • 1611-3349
OpenAlex
W133884053
Cited by
423
References
0
Citations by year
2026: 5 · 2025: 20 · 2024: 22 · 2023: 33 · 2022: 29 · 2021: 54 · 2020: 66 · 2019: 60 · 2018: 47 · 2017: 19 · 2016: 27 · 2015: 29 · 2014: 8 · 2013: 4
FWCI
14.64
Type
conference paper
Language
en
Open access
closed
Locations
  • Lecture notes in computer science (publishedVersion)
  • TU/e Research Portal (submittedVersion)
  • UCL Discovery (University College London) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Cloud Data Security Solutions
Keywords
homomorphic encryption, data privacy, polynomial approximation, binary classification, least squares, gradient descent, cloud computing, computational complexity trade-off

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review