Go to content
UR Home

Mehrparteienberechnungen und Tschebyscheff-Polynome

Lory, Peter (2012) Mehrparteienberechnungen und Tschebyscheff-Polynome. In: Konferenz "Cloud & Klein" - IT im Spannungsfeld zwischen Servercluster und Sensornetz, 26.04.2012, Wien.

PDF - Published Version
Download (119kB)


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


Export bibliographical data

Item type:Conference or workshop item (Paper)
Date:26 April 2012
Institutions:Business, Economics and Information Systems > Institut für Wirtschaftsinformatik > Alumni or Retired Professors > Professur für Wirtschaftsinformatik & Wirtschaftsmathematik (Prof. Dr. Peter Lory)
Projects:Europäischer Fond für regionale Entwicklung (EFRE)
Dewey Decimal Classification:000 Computer science, information & general works > 004 Computer science
Created at the University of Regensburg:Yes
Deposited on:04 May 2012 05:56
Last modified:13 Mar 2014 18:47
Item ID:24166
Owner only: item control page


Downloads per month over past year

  1. Homepage UR

University Library

Publication Server


Publishing: oa@ur.de

Dissertations: dissertationen@ur.de

Research data: daten@ur.de

Contact persons