113 search results - page 5 / 23 » Threshold Fully Homomorphic Encryption and Secure Computatio... |
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Semantic security against chosen-ciphertext attacks (INDCCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is o...
CANS
2011
Springer
12 years 8 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
2011
Springer
12 years 12 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
CMS
2011
12 years 8 months ago
2011
Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...