ScholarGate
Asistent

Usporedite metode

Pregledajte odabrane metode jednu uz drugu; retci koji se razlikuju su istaknuti.

Homomorfno šifriranje×Diferencijalna privatnost×Federalizirano učenje×
PodručjePrivatnostPrivatnostPrivatnost
ObiteljMachine learningMachine learningMachine learning
Godina nastanka200920062017
TvoracCraig GentryCynthia DworkMcMahan et al.
VrstaLattice-based cryptographic schemePrivacy-preserving randomized mechanismDistributed privacy-preserving machine learning
Temeljni izvorGentry, C. (2009). Fully homomorphic encryption using ideal lattices. ACM Symposium on Theory of Computing (STOC), 169–178. DOI ↗Dwork, C. (2006). Differential privacy. International Colloquium on Automata, Languages and Programming (ICALP), 1–12. DOI ↗McMahan, B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. (2017). Communication-efficient learning of deep networks from decentralized data. Artificial Intelligence and Statistics, 1273–1282. link ↗
Drugi naziviFHE, Fully Homomorphic Encryption, Leveled Homomorphic Encryption, Homomorfik ŞifrelemeDP, epsilon-differential privacy, randomized privacy, Diferansiyel GizlilikCollaborative Learning, Decentralized Learning, FedAvg, Federe Öğrenme
Srodne333
SažetakHomomorphic Encryption (HE) is a cryptographic framework that allows arbitrary computations to be performed directly on encrypted data without requiring decryption. First realized as a fully general construction by Craig Gentry in 2009 using ideal lattices, it enables a server to process sensitive data and return an encrypted result that, when decrypted by the data owner, equals the result of performing the same computation on the plaintext. It is foundational to privacy-preserving machine learning, secure cloud computing, and confidential analytics.Differential privacy is a mathematical framework for releasing statistical information about a dataset while providing rigorous guarantees that individual records cannot be identified or inferred. Introduced by Cynthia Dwork in 2006, it formalizes privacy as a probabilistic bound: any single individual's presence or absence in the dataset changes the output distribution by at most a multiplicative factor of e^ε, where ε is the privacy budget controlling the privacy–utility tradeoff.Federated Learning is a distributed machine learning paradigm introduced by McMahan et al. in 2017 in which a global model is trained collaboratively across multiple decentralized clients — such as mobile devices or hospital systems — without ever transferring raw data to a central server. Each participant computes model updates locally using its private data; only those updates, not the underlying data, are communicated and aggregated by the server to improve the shared model.
ScholarGateSkup podataka
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED
  1. v1
  2. 1 Izvori
  3. PUBLISHED

Idi na pretraživanje Preuzmi prezentaciju

ScholarGateUsporedite metode: Homomorphic Encryption · Differential Privacy · Federated Learning. Preuzeto 2026-06-18 s https://scholargate.app/hr/compare