Sciweavers

283 search results - page 25 / 57
» Bi-Deniable Public-Key Encryption
Sort
View
ICALP
2005
Springer
15 years 7 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
CCS
2008
ACM
15 years 3 months ago
Identity-based encryption with efficient revocation
Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). Any setting, PKI- or identit...
Alexandra Boldyreva, Vipul Goyal, Virendra Kumar
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...