23 search results - page 2 / 5 » Oblivious Polynomial Evaluation and Oblivious Neural Learnin... |
FC
2009
Springer
13 years 9 months ago
2009
Springer
We present an efficient protocol for the privacy-preserving, distributed learning of decision-tree classifiers. Our protocol allows a user to construct a classifier on a database h...
ICC
2007
IEEE
14 years 2 days ago
2007
IEEE
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
CLUSTER
2009
IEEE
14 years 15 days ago
2009
IEEE
—A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S...
CANS
2011
Springer
12 years 5 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
EUROCRYPT
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. The noisy polynomial interpolation problem is a new intractability assumption introduced last year in oblivious polynomial evaluation. It also appeared independently in p...