| PDF - Veröffentlichte Version (119kB) |
- URN zum Zitieren dieses Dokuments:
- urn:nbn:de:bvb:355-epub-241666
- DOI zum Zitieren dieses Dokuments:
- 10.5283/epub.24166
Zusammenfassung
The paper studies the potential of Chebyshev polynomials in the context of privacy preserving data mining: First the secure computation of the mean in a two-party scenario, second the secure distributed learning of a decision tree in both the two-party and the multi-party case. The investigations demonstrate that considerable gains in efficiency can be achieved in the design of the protocols ...
Nur für Besitzer und Autoren: Kontrollseite des Eintrags
Downloadstatistik