Sciweavers

42 search results - page 8 / 9
» Faster Fully Homomorphic Encryption
Sort
View
PAISI
2010
Springer
13 years 4 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
SIAMCOMP
2011
13 years 1 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
CRYPTO
2011
Springer
243views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Memory Delegation
We consider the problem of delegating computation, where the delegator doesn’t even know the input to the function being delegated, and runs in time significantly smaller than ...
Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ra...
AES
2000
Springer
82views Cryptology» more  AES 2000»
13 years 11 months ago
Fast Implementations of AES Candidates
Of the five AES finalists four—MARS, RC6, Rijndael, Twofish— have not only (expected) good security but also exceptional performance on the PC platforms, especially on those...
Kazumaro Aoki, Helger Lipmaa
FSE
2006
Springer
117views Cryptology» more  FSE 2006»
13 years 10 months ago
How Far Can We Go on the x64 Processors?
This paper studies the state-of-the-art software optimization methodology for symmetric cryptographic primitives on the new 64-bit x64 processors, AMD Athlon64 (AMD64) and Intel Pe...
Mitsuru Matsui