Go to content
UR Home

Mehrparteienberechnungen und Tschebyscheff-Polynome

URN to cite this document:
DOI to cite this document:
Lory, Peter
PDF - Published Version
Date of publication of this fulltext: 04 May 2012 05:56


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
  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de
0941 943 -4239 or -69394

Dissertations: dissertationen@ur.de
0941 943 -3904

Research data: datahub@ur.de
0941 943 -5707

Contact persons