| PDF - Published Version (119kB) |
- URN to cite this document:
- urn:nbn:de:bvb:355-epub-241666
- DOI to cite this document:
- 10.5283/epub.24166
Abstract
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 ...
Owner only: item control page
Download Statistics