Sciweavers

42 search results - page 6 / 9
» Faster Fully Homomorphic Encryption
Sort
View
CRYPTO
2010
Springer
201views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
Protecting Cryptographic Keys against Continual Leakage
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...
Ali Juma, Yevgeniy Vahlis
CACM
2010
117views more  CACM 2010»
14 years 10 months ago
Computing arbitrary functions of encrypted data
Suppose that you want to delegate the ability to process your data, without giving away access to it. We show that this separation is possible: we describe a "fully homomorph...
Craig Gentry
CRYPTO
2012
Springer
234views Cryptology» more  CRYPTO 2012»
13 years 7 days ago
Homomorphic Evaluation of the AES Circuit
We describe a working implementation of leveled homomorphic encryption (without bootstrapping) that can evaluate the AES-128 circuit in three different ways. One variant takes und...
Craig Gentry, Shai Halevi, Nigel P. Smart
EUROCRYPT
2011
Springer
14 years 1 months ago
Homomorphic Signatures for Polynomial Functions
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...
Dan Boneh, David Mandell Freeman
CTRSA
2008
Springer
111views Cryptology» more  CTRSA 2008»
14 years 11 months ago
Efficient Fully-Simulatable Oblivious Transfer
Oblivious transfer, first introduced by Rabin, is one of the basic building blocks of cryptographic protocols. In an oblivious transfer (or more exactly, in its 1-out-of-2 variant...
Andrew Y. Lindell