71 search results - page 1 / 15 » Computationally Private Randomizing Polynomials and Their Ap... |
COCO
2005
Springer
13 years 10 months ago
2005
Springer
STOC
1999
ACM
13 years 9 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
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,...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
CRYPTO
1997
Springer
13 years 9 months ago
1997
Springer
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices and also the secret ...