59 search results - page 2 / 12 » Fast Computation on Encrypted Polynomials and Applications |
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. Processing on encrypted data is a subject of rich investigation. Several new and exotic encryption schemes, supporting a diverse set of features, have been developed for ...
NDSS
2005
IEEE
13 years 10 months ago
2005
IEEE
In 1998, Blaze, Bleumer, and Strauss proposed an application called atomic proxy re-encryption, in which a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for...
ISSAC
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
NCA
2008
IEEE
13 years 4 months ago
2008
IEEE
Motivated by the slow learning properties of multilayer perceptrons (MLPs) which utilize computationally intensive training algorithms, such as the backpropagation learning algorit...
PEWASUN
2005
ACM
13 years 10 months ago
2005
ACM
Inherent to the wireless sensor networks are the two major problems of the broadcasting vulnerability, the limited computational capability and power budget. Even though security ...