Go to content
UR Home

Mehrparteienberechnungen und Tschebyscheff-Polynome

URN to cite this document:
urn:nbn:de:bvb:355-epub-241666
Lory, Peter
[img]
Preview
PDF - Published Version
(119kB)
Date of publication of this fulltext: 04 May 2012 05:56


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 ...

plus


Owner only: item control page
  1. Homepage UR

University Library

Publication Server

Contact:

Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons