Sciweavers

286 search results - page 27 / 58
» Key-Privacy in Public-Key Encryption
Sort
View
TCC
2009
Springer
153views Cryptology» more  TCC 2009»
16 years 2 months ago
On the (Im)Possibility of Key Dependent Encryption
We study the possibility of constructing encryption schemes secure under messages that are chosen depending on the key k of the encryption scheme itself. We give the following sep...
Iftach Haitner, Thomas Holenstein
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
15 years 8 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
SCN
2008
Springer
15 years 1 months ago
Linear Bandwidth Naccache-Stern Encryption
Abstract. The Naccache-Stern (ns) knapsack cryptosystem is an original yet little-known public-key encryption scheme. In this scheme, the ciphertext is obtained by multiplying publ...
Benoît Chevallier-Mames, David Naccache, Jac...
161
Voted
JDCTA
2010
150views more  JDCTA 2010»
14 years 8 months ago
Provable Password-Authenticated Key Exchange Protocol against Imposter Attack on Ad Hoc Networks
In wireless ad hoc networks environment, Bellovin and Merritt first developed a password-based Encrypted Key Exchange (EKE) protocol against offline dictionary attacks using both ...
Ang Gao
PKC
2012
Springer
255views Cryptology» more  PKC 2012»
13 years 4 months ago
Better Bootstrapping in Fully Homomorphic Encryption
Gentry’s bootstrapping technique is currently the only known method of obtaining a “pure” fully homomorphic encryption (FHE) schemes, and it may offers performance advantage...
Craig Gentry, Shai Halevi, Nigel P. Smart